CN106407001A - Graphical editing system based on region matching algorithm - Google Patents
Graphical editing system based on region matching algorithm Download PDFInfo
- Publication number
- CN106407001A CN106407001A CN201610626203.0A CN201610626203A CN106407001A CN 106407001 A CN106407001 A CN 106407001A CN 201610626203 A CN201610626203 A CN 201610626203A CN 106407001 A CN106407001 A CN 106407001A
- Authority
- CN
- China
- Prior art keywords
- mobile phone
- task
- cluster
- micro
- processing unit
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
- G06F9/5088—Techniques for rebalancing the load in a distributed system involving task migration
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M1/00—Substation equipment, e.g. for use by subscribers
- H04M1/72—Mobile telephones; Cordless telephones, i.e. devices for establishing wireless links to base stations without route selection
- H04M1/724—User interfaces specially adapted for cordless or mobile telephones
- H04M1/72403—User interfaces specially adapted for cordless or mobile telephones with means for local support of applications that increase the functionality
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5017—Task decomposition
Abstract
The invention discloses a graphical editing system based on a region matching algorithm. The graphical editing system comprises a graphical editing unit, a processing unit, a communication unit and a data processing unit, wherein the graphical editing unit, the processing unit and the communication unit are arranged on a mobile terminal; the data processing unit is arranged on a remote server; the graphical editing unit comprises a graphical editing area and a graphical element library, wherein the graphical element library stores graphical blocks which express a specific logic statement; during work, the graphical blocks are dragged from the graphical element library to the graphical editing area, and are subjected to permutation and combination to form a graphical block sequence, wherein the graphical block sequence has a specific code meaning; and the processing unit collects the code meaning expressed by the graphical block sequence, and sends the meaning to the data processing unit in the remote server through the communication unit.
Description
Technical field
The present invention relates to a kind of graphical editing system based on Region Matching Algorithm.It is related to Patent classificating number H04 electricity logical
In the transmission of letter technology H04L digital information, such as single group of telegraph communication H04L29/00 H04L 1/00 to H04L 27/00
Device, equipment, circuit and the system H04L29/02 Control on Communication not comprised；Communication process H04L29/06 is characterized with agreement
H04L29/08 transmission control procedure, such as data link level control procedure.
Background technology
With respect to the almost sluggish slow development in recent years of domestic desktop level processor, at the reduced instruction set computer of mobile terminal
The disposal ability of reason device has significant progress, and the gap of the disposal ability of simple Floating-point Computation ability and desktop processor is
Through foreshortening to 2-3.
Remove outside the great-leap-forward development of processor and graphic process unit, the such as internal memory, memory space of intelligent terminal with
And the performance such as power supply, heat-sinking capability caught up with and exceeded desktop system, and systems soft ware is exerted manufacturer is insistent
Under power, the requirement to system also reduces continuous.The performance of cell phone system software is needed by the development speed of generally hardware
Ask, define performance redundancy.
Content of the invention
The problem being existed according to prior art, the invention discloses a kind of graphical editor system based on Region Matching Algorithm
System, including graphics edition unit, processing unit and the communication unit being arranged on mobile terminal and be arranged on remote server
Data processing unit；
Described graphics edition unit includes the figure of the graph block of graphics edition region and storage expression certain logic sentence
Shape element database；
During work, pull described graph block from described pictorial element storehouse and combine formation to graphics edition area arrangement
Graph block sequence, described graph block sequence has specific code implication；
Implication is sent out by the code implication that the described graph block sequence of processing unit collection represents by described communication unit
Deliver to the data processing unit in remote server；
The described code implication of described data processing unit analysis, decomposes to the processor active task of code, send to
The specific mobile terminal of particular range, carries out the calculating of task resolution by mobile terminal and is back to result of calculation described remote
The data processing unit of journey server, after being collected by data processing unit, generates final operation result, computing is simultaneously tied by storage
Fruit sends to the mobile terminal of editing graph, completes image conversion and becomes.
As preferred embodiment, described data processing unit adopts Distributed Queuing Service method Real-time Collection system
The calculating task information of the configuration information of non-programmed task mobile phone of registration and the upload of programmed tasks mobile phone in system：Position to mobile phone
Put stream data to be sampled storing the historical act region forming mobile phone；
The delivery condition of the type of the calculating task of Task-decomposing and system mobile phone is to mobile phone and calculating task as needed
Information is screened：The calculating task information of the configuration information of same type and same type is concentrated arrangement respectively, simultaneously to
The mobile phone arranging and calculating task information is concentrated to carry out real-time update；
Micro- cluster is carried out to each mobile phone task type data set：Using clustering algorithm pair in the time window setting
Each mobile phone task type data set above-mentioned is clustered by distance, so that each mobile phone task type data set is produced multiple
Micro- cluster；
Calculate matching scheme for each micro- cluster：In the time window pre-setting, to described micro- cluster using evolution
Algorithm carries out mobile phone task supply-demand mode Combinatorial Optimization to it, forms mobile phone task matching scheme and preserves.
Further, each mobile phone task type data set is carried out with micro- cluster concrete in the following way：Initially
Change micro- cluster
In initial time, for each VCtypeIt is individual initially micro- that data set forms q using the clustering algorithm based on distance
Cluster, specifies when q initializes for clustering algorithm, and
Q=μ * | VCtype|
Wherein 0 ＜ μ ＜ 0.25, | VCtype| for mobile phone task type data set VCtypeScale, using M1...MqRepresent
Whole q micro- clusters in a certain moment；
For each micro- cluster, if only mobile phone or only calculating task data in cluster, delete this micro- cluster, and calculate this
The distance at mobile phone historical act regional center position or calculating task position and other Wei Cu centers in micro- cluster, finds nearest micro-
Cluster Mp, and this data point is placed in micro- cluster MpIn.
Further, calculate matching scheme for each micro- cluster, specifically in the following way：Set up mobile phone task
Join model：If certain micro- cluster MpIn have K (k=1,2,3....K) individual mobile phone and I (i=1,2 ..., I) individual calculating task data, by
All couplings xkiMatrix V CM of composition is a solution of mobile phone task matching problem.
The matching scheme of each row vector of VCM each mobile phone corresponding, each calculating corresponding of each column vector is appointed
The matching scheme of business decomposition demand, wherein
Mobile phone task coupling combines optimized mathematical model
Max Z=w1R+w2(C+1)-1(2)
Meet following constraints simultaneously：
Limiting each calculating task decomposition demand at most has MIIndividual
Tennis partner's machine；
Limit each mobile phone and at most mate MKIndividual calculating task decomposes demand；
The all of calculating task decomposition requiring each mobile phone coupling needs
The total computational task weight asked is less than gbk；
Calculating task weight in each scheme recommended to each mobile phone is both less than
The load-carrying of Task-decomposing mobile phone；
Wherein i=1,2 ..., I, k=1,2 ..., K
The Task-decomposing ability of wherein each mobile phone is bk, each calculating task demand is di, w1And w2For information resources profit
With the preference of rate R and overall matching cost C two indices, and w1+w2=1, the wherein calculating of information resources utilization rate R is public
Formula is：
C is overall matching cost, and under conditions of only considering distance costs, the computing formula of C is
By adopting technique scheme, a kind of graphical editor system based on Region Matching Algorithm disclosed by the invention
System, by by but the multiplexed transport that creates of mobile phone decomposed to server, by system by the task after decomposing send to
Mobile phone in the range of specific region carries out Distributed Calculation, greatly improves the utilization ratio of idle mobile phone, is extended mobile phone
Operational performance open new path.
Brief description
In order to be illustrated more clearly that the embodiment of the present application or technical scheme of the prior art, below will be to embodiment or existing
Have technology description in required use accompanying drawing be briefly described it should be apparent that, drawings in the following description be only this
Some embodiments described in application, for those of ordinary skill in the art, on the premise of not paying creative work,
Other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is the system module figure of the present invention
Specific embodiment
For making technical scheme and advantage clearer, with reference to the accompanying drawing in the embodiment of the present invention, to this
Technical scheme in inventive embodiments carries out clearly complete description：
Embodiment：
A kind of graphical editing system based on Region Matching Algorithm as shown in Figure 1, including being arranged on mobile terminal
Graphics edition unit, processing unit and communication unit and the data processing unit being arranged on remote server；
Described graphics edition unit includes the figure of the graph block of graphics edition region and storage expression certain logic sentence
Shape element database；
During work, pull described graph block from described pictorial element storehouse and combine formation to graphics edition area arrangement
Graph block sequence, described graph block sequence has specific code implication；
Rely on the hardware handles software translating task of itself in view of mobile phone, substantial amounts of handset capability can be taken, lead to handss
Machine probably due to processor is stuck leads to not normally use, as preferred embodiment,
Implication is sent out by the code implication that the described graph block sequence of processing unit collection represents by described communication unit
Deliver to the data processing unit in remote server.
The described code implication of described data processing unit analysis, decomposes to the processor active task of code, send to
The specific mobile terminal of particular range, carries out the calculating of task resolution by mobile terminal and is back to result of calculation described remote
The data processing unit of journey server, after being collected by data processing unit, generates final operation result, computing is simultaneously tied by storage
Fruit sends to the mobile terminal of editing graph, completes image conversion and becomes.
Described data processing unit is appointed using the non-programmed of registration in Distributed Queuing Service method real-time acquisition system
The configuration information of business mobile phone and the calculating task information of programmed tasks mobile phone upload：The position stream data of mobile phone is sampled
Storage forms the historical act region of mobile phone；
The delivery condition of the type of the calculating task of Task-decomposing and system mobile phone is to mobile phone and calculating task as needed
Information is screened：The calculating task information of the configuration information of same type and same type is concentrated arrangement respectively, simultaneously to
The mobile phone arranging and calculating task information is concentrated to carry out real-time update；
Micro- cluster is carried out to each mobile phone task type data set：Using clustering algorithm pair in the time window setting
Each mobile phone task type data set above-mentioned is clustered by distance, so that each mobile phone task type data set is produced multiple
Micro- cluster；
Calculate matching scheme for each micro- cluster：In the time window pre-setting, to described micro- cluster using evolution
Algorithm carries out mobile phone task supply-demand mode Combinatorial Optimization to it, forms mobile phone task matching scheme and preserves.
Further, each mobile phone task type data set is carried out with micro- cluster concrete in the following way：Initially
Change micro- cluster
In initial time, for each VCtypeIt is individual initially micro- that data set forms q using the clustering algorithm based on distance
Cluster, specifies when q initializes for clustering algorithm, and
Q=μ * | VCtype|
Wherein 0 ＜ μ ＜ 0.25, | VCtype| for mobile phone task type data set VCtypeScale, using M1...MqRepresent
Whole q micro- clusters in a certain moment；
For each micro- cluster, if only mobile phone or only calculating task data in cluster, delete this micro- cluster, and calculate this
The distance at mobile phone historical act regional center position or calculating task position and other Wei Cu centers in micro- cluster, finds nearest micro-
Cluster Mp, and this data point is placed in micro- cluster MpIn.
As preferred embodiment, calculate matching scheme for each micro- cluster, specifically in the following way：Set up handss
Machine task Matching Model：If certain micro- cluster MpIn have K (k=1,2,3....K) individual mobile phone and I (i=1,2 ..., I) individual calculating to appoint
Business data, by all couplings xkiMatrix V CM of composition is a solution of mobile phone task matching problem.
The matching scheme of each row vector of VCM each mobile phone corresponding, each calculating corresponding of each column vector is appointed
The matching scheme of business decomposition demand, wherein
Mobile phone task coupling combines optimized mathematical model
Max Z=w1R+w2(C+1)-1(2)
Meet following constraints simultaneously：
Limiting each calculating task decomposition demand at most has MIIndividual
Tennis partner's machine；
Limit each mobile phone and at most mate MKIndividual calculating task decomposes demand；
The all of calculating task decomposition requiring each mobile phone coupling needs
The total computational task weight asked is less than gbk；
Calculating task weight in each scheme recommended to each mobile phone is both less than
The load-carrying of Task-decomposing mobile phone；
Wherein i=1,2 ..., I, k=1,2 ..., K
The Task-decomposing ability of wherein each mobile phone is bk, each calculating task demand is di, w1And w2For information resources profit
With the preference of rate R and overall matching cost C two indices, and w1+w2=1, the wherein calculating of information resources utilization rate R is public
Formula is：
C is overall matching cost, and under conditions of only considering distance costs, the computing formula of C is.
The above, the only present invention preferably specific embodiment, but protection scope of the present invention is not limited thereto,
Any those familiar with the art the invention discloses technical scope in, technology according to the present invention scheme and its
Inventive concept equivalent or change in addition, all should be included within the scope of the present invention.
Claims (4)
1. a kind of graphical editing system based on Region Matching Algorithm is it is characterised in that include being arranged on the figure of mobile terminal
Edit cell, processing unit and communication unit and the data processing unit being arranged on remote server；
Described graphics edition unit includes the pattern primitive of the graph block of graphics edition region and storage expression certain logic sentence
Plain storehouse；
During work, pull described graph block to graphics edition area arrangement from described pictorial element storehouse and combine formation figure
Block sequence, described graph block sequence has specific code implication；
The code implication that the described graph block sequence of processing unit collection represents, by described communication unit by implication send to
Data processing unit in remote server；
The described code implication of described data processing unit analysis, decomposes to the processor active task of code, sends to basis
In system, the historical act region of other intelligent terminal carries out Region Matching successfully specific mobile terminal, is carried out by mobile terminal
Result of calculation is simultaneously back to the data processing unit of described remote server, by data processing unit by the calculating of task resolution
After collecting, generate final operation result, operation result is simultaneously sent to the mobile terminal of editing graph by storage, completes image conversion
Become.
2. the graphical editing system based on Region Matching Algorithm according to claim 1, is further characterized in that described
Data processing unit adopts the configuration letter of the non-programmed task mobile phone of registration in Distributed Queuing Service method real-time acquisition system
Breath and the calculating task information of programmed tasks mobile phone upload：The position stream data of mobile phone is sampled storing formation mobile phone
Historical act region；
The delivery condition of the type of the calculating task of Task-decomposing and system mobile phone is to mobile phone and calculating task information as needed
Screened：The calculating task information of the configuration information of same type and same type is concentrated arrangement respectively, simultaneously to having concentrated
The mobile phone arranging and calculating task information carry out real-time update；
Micro- cluster is carried out to each mobile phone task type data set：Using clustering algorithm to above-mentioned in the time window setting
Each mobile phone task type data set is clustered by distance, so that each mobile phone task type data set is produced multiple micro-
Cluster；
Calculate matching scheme for each micro- cluster：In the time window pre-setting, evolution algorithm is adopted to described micro- cluster
It is carried out with mobile phone task supply-demand mode Combinatorial Optimization, forms mobile phone task matching scheme and preserve.
3. the graphical editing system based on Region Matching Algorithm according to claim 2, is further characterized in that：To each
It is concrete in the following way that individual mobile phone task type data set carries out micro- cluster：Initialize micro- cluster
In initial time, for each VCtypeData set forms q initially micro- cluster using the clustering algorithm based on distance, and q is
Specify during clustering algorithm initialization, and
Q=μ * | VCtype|
Wherein 0 ＜ μ ＜ 0.25, | VCtype| for mobile phone task type data set VCtypeScale, using M1...MqRepresent certain for the moment
The whole q micro- clusters carved；
For each micro- cluster, if only mobile phone or only calculating task data in cluster, delete this micro- cluster, and calculate this micro- cluster
Middle mobile phone historical act regional center position or calculating task position and the distance at other Wei Cu centers, find nearest micro- cluster
Mp, and this data point is placed in micro- cluster MpIn.
4. the graphical editing system based on Region Matching Algorithm according to claim 3, is further characterized in that：For every
One micro- cluster calculates matching scheme, specifically in the following way：Set up mobile phone task Matching Model：If certain micro- cluster MpIn have K (k
=1,2,3 ... .K) individual mobile phone and the individual calculating task data of I (i=1,2 ..., I), by all couplings xkiComposition matrix V CM be
One solution of mobile phone task matching problem.
The matching scheme of each row vector of VCM each mobile phone corresponding, each column vector each calculating task corresponding is divided
The matching scheme of solution demand, wherein
Mobile phone task coupling combines optimized mathematical model
Max Z=w1R+w2(C+1)-1(2)
Meet following constraints simultaneously：
Limiting each calculating task decomposition demand at most has MIIndividual coupling handss
Machine；
Limit each mobile phone and at most mate MKIndividual calculating task decomposes demand；
The all of calculating task requiring each mobile phone coupling decomposes demand
Total computational task weight is less than gbk；
Calculating task weight in each scheme recommended to each mobile phone is both less than task
Decompose the load-carrying of mobile phone；
Wherein i=1,2 ..., I, k=1,2 ..., K
The Task-decomposing ability of wherein each mobile phone is bk, each calculating task demand is di, w1And w2For information resources utilization rate R
With the preference of overall matching cost C two indices, and w1+w2=1, the computing formula of wherein information resources utilization rate R is：
C is overall matching cost, and under conditions of only considering distance costs, the computing formula of C is.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610626203.0A CN106407001A (en) | 2016-08-02 | 2016-08-02 | Graphical editing system based on region matching algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610626203.0A CN106407001A (en) | 2016-08-02 | 2016-08-02 | Graphical editing system based on region matching algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106407001A true CN106407001A (en) | 2017-02-15 |
Family
ID=58004928
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610626203.0A Pending CN106407001A (en) | 2016-08-02 | 2016-08-02 | Graphical editing system based on region matching algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106407001A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108415457A (en) * | 2018-03-15 | 2018-08-17 | 西北工业大学 | A kind of graphical navigational duty setting method of submarine navigation device |
| CN110414645A (en) * | 2018-04-28 | 2019-11-05 | 深圳果力智能科技有限公司 | A kind of pattern recognition method based on Match of elemental composition |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505481A (en) * | 2008-02-05 | 2009-08-12 | 天宝导航有限公司 | Resource scheduling apparatus and method |
| CN102546905A (en) * | 2010-12-20 | 2012-07-04 | 康佳集团股份有限公司 | Mobile terminal, method for realizing screen capture in same and system |
| CN103164287A (en) * | 2013-03-22 | 2013-06-19 | 河海大学 | Distributed-type parallel computing platform system based on Web dynamic participation |
| CN103472985A (en) * | 2013-06-17 | 2013-12-25 | 展讯通信（上海）有限公司 | User editing method of three-dimensional (3D) shopping platform display interface |
| CN103957240A (en) * | 2014-04-09 | 2014-07-30 | 广州市久邦数码科技有限公司 | Weather system capable of shooting pictures in real time and conducting sharing and implementation method of weather system capable of shooting pictures in real time and conducting sharing |
| CN105511860A (en) * | 2015-11-30 | 2016-04-20 | 大连文森特软件科技有限公司 | On-line graphical programming system |
-
2016
- 2016-08-02 CN CN201610626203.0A patent/CN106407001A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101505481A (en) * | 2008-02-05 | 2009-08-12 | 天宝导航有限公司 | Resource scheduling apparatus and method |
| CN102546905A (en) * | 2010-12-20 | 2012-07-04 | 康佳集团股份有限公司 | Mobile terminal, method for realizing screen capture in same and system |
| CN103164287A (en) * | 2013-03-22 | 2013-06-19 | 河海大学 | Distributed-type parallel computing platform system based on Web dynamic participation |
| CN103472985A (en) * | 2013-06-17 | 2013-12-25 | 展讯通信（上海）有限公司 | User editing method of three-dimensional (3D) shopping platform display interface |
| CN103957240A (en) * | 2014-04-09 | 2014-07-30 | 广州市久邦数码科技有限公司 | Weather system capable of shooting pictures in real time and conducting sharing and implementation method of weather system capable of shooting pictures in real time and conducting sharing |
| CN105511860A (en) * | 2015-11-30 | 2016-04-20 | 大连文森特软件科技有限公司 | On-line graphical programming system |
Non-Patent Citations (2)
| Title |
|---|
| 戴丽贞等: "一种基于GPRS服务的分布式计算模型", 《中国新通信》 * |
| 马克等: "分布式实时流数据聚类算法及其基于Storm的实现", 《南京邮电大学学报(自然科学版)》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108415457A (en) * | 2018-03-15 | 2018-08-17 | 西北工业大学 | A kind of graphical navigational duty setting method of submarine navigation device |
| CN110414645A (en) * | 2018-04-28 | 2019-11-05 | 深圳果力智能科技有限公司 | A kind of pattern recognition method based on Match of elemental composition |
| CN110414645B (en) * | 2018-04-28 | 2023-05-30 | 深圳果力智能科技有限公司 | Pattern recognition method based on element matching |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101973031B (en) | Cloud robot system and implementation method | |
| CN103761309B (en) | Operation data processing method and system | |
| CN113033712B (en) | Multi-user cooperative training people flow statistical method and system based on federal learning | |
| CN113469373B (en) | Model training method, system, equipment and storage medium based on federal learning | |
| CN113505882B (en) | Data processing method based on federal neural network model, related equipment and medium | |
| CN113312177B (en) | Wireless edge computing system and optimizing method based on federal learning | |
| CN109408500A (en) | Artificial intelligence operation platform | |
| CN107809490A (en) | The data transmission method of intelligent ship and its information management and control system, device | |
| CN110058934A (en) | A method of it is calculated in extensive cloud and mist and formulates OPTIMAL TASK unloading decision in environment | |
| CN108449383A (en) | Distributed thin cloud computing system mobile in real time | |
| CN111935140B (en) | Abnormal message identification method and device | |
| CN106407001A (en) | Graphical editing system based on region matching algorithm | |
| CN107609694B (en) | Structure optimization method for offshore wind power cluster power transmission system and storage medium | |
| JPH0445025B2 (en) | ||
| CN104270453B (en) | Data communications method and server between a kind of multistage server | |
| Zhou | Uncapacitated facility layout problem with stochastic demands | |
| CN106302657A (en) | Inline graphics game making system based on Distributed Calculation | |
| CN106254454A (en) | The inline graphics online literature editing system calculated based on moving distributing | |
| CN103945004B (en) | Data dispatching method and system between a kind of data center | |
| CN106155798A (en) | The online image conversion programing system calculated based on moving distributing | |
| CN110290206A (en) | A kind of distributed computing system and method for cafe environment | |
| CN113742778B (en) | Distributed machine learning method and system based on federal learning and ALQ compression | |
| CN109831421A (en) | Data managing method, system and computer readable storage medium | |
| CN114971053A (en) | Training method and device for online prediction model of network line loss rate of low-voltage transformer area | |
| CN107902503A (en) | Call method, apparatus, equipment and the storage medium of elevator |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170215 |