CN109740819A - A kind of monitoring water environment algorithm - Google Patents
A kind of monitoring water environment algorithm Download PDFInfo
- Publication number
- CN109740819A CN109740819A CN201910026846.5A CN201910026846A CN109740819A CN 109740819 A CN109740819 A CN 109740819A CN 201910026846 A CN201910026846 A CN 201910026846A CN 109740819 A CN109740819 A CN 109740819A
- Authority
- CN
- China
- Prior art keywords
- station
- monitoring
- analysis
- analysis station
- assigned
- 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
Abstract
This application involves monitoring water environment field more particularly to a kind of monitoring water environment algorithms, comprising: generates monitoring station dictionary and analysis station dictionary, generates monitoring station list and analysis station list, sets minimum number MIN and maximum number MAX；It is randomly assigned monitoring station for all analysis stations of the monitoring station number less than MIN can be assigned in analysis station list, and the monitoring station of analysis station and distribution is associated, the list of replacement analysis station；Updated analysis station list is handled, monitoring station is sequentially distributed using Weighted random matching algorithm is reconciled for the analysis station in analysis station list, the monitoring station quantity that each analysis station is assigned in analysis station list is made to be equal to MIN；The analysis station in analysis station list is continued as using reconciliation Weighted random matching algorithm and sequentially distributes monitoring station, and the monitoring station quantity that each analysis station is assigned in analysis station list is made to be equal to MAX；One monitoring station is only capable of being assigned to an analysis station, and an analysis station can be assigned to multiple monitoring stations.
Description
Technical field
The present invention relates to monitoring water environment field more particularly to a kind of monitoring water environment algorithms.
Background technique
Between solving the problems, such as two set when things matching relationship, it generally can use circulation and sequentially distribute and random
The method matched, it is simple and clear convenient to carry out that circulation sequentially distributes this method, and largely ensure that allocation result
Equilibrium degree, this mode is very common in simple practical problem, but circulation sequentially distributes the corresponding relationship between things
Confidentiality in terms of performance it is poor.And random fit is all based on probabilistic uncertainty behavior because of match selection each time,
The equilibrium degree of final result is not can guarantee, it is possible that entire correspondence results is unbalanced, it is difficult to meet practical problem
Needs.Because random fit essence is the probability selection sequentially carried out, may finally occur unmatching or violating just
The corresponding relationship of beginning condition, so that final corresponding relationship is unbalanced.
Therefore, the equilibrium degree of matched final result how is controlled, so that final corresponding relationship is balanced, it is ability
The current urgent problem in domain.
Summary of the invention
This application provides a kind of monitoring water environment algorithms, to control the equilibrium degree of matched final result, so that most
Whole corresponding relationship is balanced.
In order to solve the above technical problems, the application provides the following technical solutions:
A kind of monitoring water environment algorithm includes the following steps: to generate monitoring station dictionary and analysis station dictionary, generates monitoring station
List and analysis station list set minimum number MIN and maximum number MAX；For monitoring station can be assigned in analysis station list
All analysis stations of the number less than MIN are randomly assigned monitoring station, and the monitoring station of analysis station and distribution are associated, replacement analysis
It stands list；Updated analysis station list is handled, is in analysis station list using reconciliation Weighted random matching algorithm
Analysis station sequentially distributes monitoring station, and the monitoring station quantity that each analysis station is assigned in analysis station list is made to be equal to MIN；It utilizes
The analysis station that Weighted random matching algorithm continues as in analysis station list that reconciles sequentially distributes monitoring station, makes every in analysis station list
The assigned monitoring station quantity of one analysis station is equal to MAX；One monitoring station is only capable of being assigned to an analysis station, an analysis
Multiple monitoring stations can be assigned to by standing.
Preferably, the reconciliation Weighted random matching algorithm passes through formulaIt is assigned to calculate monitoring station
To the probability of i-th analysis station, the target analysis station being assigned according to probability selection analysis station as the monitoring station；
Wherein, n represents the analysis station quantity that can distribute to certain monitoring station, and Ji represents the prison that i-th of analysis station can be assigned
Survey station quantity, Pi are the probability that the monitoring station is assigned to i-th of analysis station, and Jk represents what k-th of analysis station can be assigned
Monitoring station quantity.
Preferably, after step s 140, the unassigned analysis station in monitoring station if it exists, then distribute to this for this monitoring station
The maximum analysis station of monitoring station number can be assigned in the corresponding all analysis stations in monitoring station.
Preferably, after step s 140, the first analysis station is not assigned to monitoring station if it exists, then is its distribution monitoring
It stands.
Preferably, search each monitoring station that the first analysis station can be assigned in analysis station dictionary, search with it is each
It can be assigned the maximum analysis station of monitoring station number in a associated second analysis station in monitoring station, it, will be described as third analysis station
Monitoring station and third analysis station disassociation relationship, the monitoring station is associated with the first analysis station.
Preferably, after step s 140, the quantity for the monitoring station being assigned if there is analysis station is greater than MAX, will surpass
The monitoring station of MAX is distributed once again out.
Preferably, the monitoring station beyond the MAX analysis station being assigned is related to it with the analysis station disassociation
Afterwards, then it will exceed the monitoring station of MAX and distributed once again.
Preferably, minimum number MIN and maximum number MAX is used as dividing two boundary parameters of entire algorithm.
Preferably, monitoring station is stored in the dictionary of monitoring station and can distribute to the analysis station of monitoring station, deposit in analysis station dictionary
It puts analysis station and the monitoring station of analysis station can be distributed to.
Preferably, monitoring station list is used to store the monitoring station of unallocated analysis station, analysis station list be used to store not by
Distribute the analysis station of full monitoring station.
What the application realized has the beneficial effect that: finally obtained by being ensured using reconciliation Weighted random matching algorithm
The assigned monitoring station number otherness of each analysis station is smaller, and final allocation result is balanced.The present invention is by two
Aspect ensures the equilibrium degree of allocation result, first is that using Weighted random matching algorithm is reconciled ensure allocation result equilibrium degree,
It is optimized second is that being distributed once again by the monitoring station that will exceed MAX, to ensure again the equilibrium degree of allocation result.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The some embodiments recorded in invention can also be obtained according to these attached drawings other for those of ordinary skill in the art
Attached drawing.
Fig. 1 is the flow chart of monitoring water environment algorithm provided by the embodiments of the present application.
Specific embodiment
The embodiment of the present invention is described below in detail, examples of the embodiments are shown in the accompanying drawings, wherein from beginning to end
Same or similar label indicates same or similar element or element with the same or similar functions.Below with reference to attached
The embodiment of figure description is exemplary, and for explaining only the invention, and is not construed as limiting the claims.
In monitoring water environment, in order to guarantee the quality of achievement data, the sample of monitoring station needs to be assigned to unknown point
Analysis station, and the quantity of the analyzable monitoring station in each analysis station be also it is different, to guarantee what each analysis station was assigned
Monitoring station number otherness is smaller, so that final allocation result is balanced.This programme is by using reconciliation Weighted random
It is realized with algorithm.
Based on this, this application provides a kind of monitoring water environment algorithms, include the following steps:
Step S110, monitoring station dictionary J_DICT and analysis station dictionary F_DICT is generated, monitoring station list J_LIST is generated
And analysis station list F_LIST, set a minimum number MIN and a maximum number MAX.
Wherein, what is stored in monitoring station dictionary J_DICT is monitoring station and the analysis station that can distribute to monitoring station, analysis
It stands and is used to store analysis station in dictionary F_DICT and the monitoring station of analysis station can be distributed to.
Wherein, analysis station and monitoring station are one-to-many relationship.Specifically, exactly a monitoring station can only be assigned to one
A analysis station, and an analysis station can be assigned to multiple monitoring stations, and monitoring station can be assigned to the quantity of analysis station
It is fixed.
Monitoring station list J_LIST is used to store the monitoring station of unallocated analysis station, and analysis station list F_LIST is used to store
The analysis station of unassigned full monitoring station.
Minimum number MIN and maximum number MAX is used as dividing two boundary parameters of entire algorithm.
Step S120, for can be assigned in analysis station list F_LIST the analysis station of the quantity of monitoring station less than MIN according to
Analysis station dictionary F_DICT is randomly assigned monitoring station, and the monitoring station of analysis station and distribution is associated, replacement analysis station column
Table F_LIST.
Specifically, the institute that the monitoring station quantity that analysis station can be assigned is less than MIN is found out in analysis station list F_LIST
There is analysis station, each analysis station proceeded as follows, is demonstrated by taking an analysis station as an example below:
All monitoring stations that the analysis station can be assigned are searched in analysis station dictionary F_DICT, are at random the analysis station point
It is associated with monitoring station, and by the monitoring station of analysis station and distribution, until the monitoring station quantity that the analysis station can be assigned is
Zero.For example, the monitoring station quantity that analysis station can be assigned is 3, it is less than MIN, then searches this point in analysis station dictionary F_DICT
Monitoring station is distributed for analysis station in all monitoring stations that analysis station can be assigned, until the monitoring station quantity for being analysis station distribution is 3.
Above-mentioned analysis station is removed in analysis station list F_LIST and analysis station dictionary F_DICT, that is, to analysis station list F_LIST
With analysis station dictionary F_DICT update, removed in monitoring station list J_LIST and monitoring station dictionary J_DICT distributed to it is above-mentioned
The monitoring station of analysis station, that is, monitoring station list J_LIST and monitoring station dictionary J_DICT is updated.
Step S130, updated analysis station list F_LIST is handled, utilizes reconciliation Weighted random matching algorithm
Monitoring station is sequentially distributed for the analysis station in analysis station list F_LIST, each analysis station in analysis station list is made to be assigned prison
Survey station quantity is equal to MIN.
Specifically, all monitoring stations in the list of monitoring station are ranked up, ordering rule is according in the list of monitoring station
The analysis station quantity that each monitoring station can be assigned carries out ascending order arrangement from less to more, according to arriving in the past in the list of monitoring station
Sequence afterwards is that analysis station is distributed in each monitoring station, carries out following operation to each monitoring station, is supervised below with one
It is demonstrated for survey station:
All analysis stations that can distribute to the monitoring station are searched from the dictionary J_DICT of monitoring station, can distribute to the monitoring
It is utilized in all analysis stations stood and reconciles Weighted random matching algorithm as the maximum analysis station of monitoring station allocation probability.
Using reconciling, the method that Weighted random matching algorithm is monitoring station distribution analysis station is specific as follows, it is assumed that in monitoring station
Can be distributed in dictionary J_DICT certain monitoring station J analysis station be F1, F2 ... Fn, the monitoring that this N number of analysis station has been assigned
Quantity of standing is respectively J1, J2.....Jn, then is that monitoring station J is assigned to i-th of analysis using reconciliation Weighted random matching algorithm
The probability P i to stand is
In N number of analysis station the biggish analysis station of probability as monitoring station J be assigned target analysis station a possibility that compared with
Greatly.Wherein it is preferred to the target analysis that the analysis station for selecting maximum probability from N number of analysis station is assigned as monitoring station J
It stands.After being assigned, monitoring station J is removed in analysis station dictionary, removes the monitoring in monitoring station list and monitoring station dictionary
Stand J.Monitoring station J and target analysis station are associated.
During distributing analysis station for each monitoring station, when the quantity of the associated monitoring station of some analysis station is equal to
When MIN, this analysis station will be no longer participate in the process of distribution monitoring station, if the monitoring station quantity of all analysis stations distribution all reaches
It is zero that monitoring station quantity, which can be distributed, to MIN or analysis station, then end step S130.
As an example: assuming that there are monitoring station A, monitoring station A assignable analysis station difference in the dictionary of monitoring station
For b, c.The monitoring station quantity that analysis station b, c have been assigned in analysis station dictionary is respectively 6,9, then utilizes reconciliation Weighted random
Matching algorithm is that the probability of analysis station b, c of monitoring station A distribution are respectively Pb, Pc:
Pb > Pc known to Pb, Pc is compared, so a possibility that distributing analysis station b for monitoring station A is larger.If being prison
Survey station A is assigned with analysis station b, then the monitoring station quantity that analysis station c has been assigned becomes 7.
Assuming that B assignable analysis station in the dictionary of monitoring station in monitoring station is respectively c, d there is also monitoring station B；Analysis station
C, the monitoring station quantity being assigned in d analysis station dictionary is respectively 8,10, then is prison using reconciliation Weighted random matching algorithm
The probability of analysis station c, d of survey station B distribution are respectively Pc, Pd
Pc > Pd known to Pc, Pd is compared, so a possibility that distributing analysis station c for monitoring station B is larger.If being prison
Survey station B is assigned with analysis station c, then the monitoring station quantity that analysis station d can be assigned becomes 9.
And so on, when there are the assignable analysis station set of monitoring station C and the assignable analysis station of monitoring station B or A
When set has intersection, above step is continued to execute.Thus, it is possible to find out, it is being using reconciliation Weighted random matching algorithm
When analysis station is distributed in certain monitoring station, the prison being assigned in each assignable analysis station of this monitoring station can be preferentially distributed
The smallest analysis station of survey station quantity.It therefore is not in that certain analysis station distribution are assigned to less than monitoring station or certain analysis stations
Monitoring station it is excessive and unbalanced phenomenon occur, thus guarantee the assigned monitoring station number otherness of each analysis station compared with
It is small.
Step S140, the analysis station in analysis station list F_LIST is continued as sequentially using reconciliation Weighted random matching algorithm
Monitoring station is distributed, the monitoring station quantity that each analysis station is assigned in analysis station list is made to be equal to MAX.
It specifically, is that analysis station is distributed in each monitoring station according to vertical sequence in the list of monitoring station, to every
One monitoring station all carries out following operation, is demonstrated by taking a monitoring station as an example below:
All analysis stations that can distribute to the monitoring station are searched from the dictionary J_DICT of monitoring station, can distribute to the monitoring
It is utilized in all analysis stations stood and reconciles Weighted random matching algorithm as the maximum analysis station of monitoring station allocation probability.It will be each
A monitoring station and the analysis station distributed are associated, when there are the quantity of the associated monitoring station of some analysis station to be equal to MAX
When, this analysis station will be no longer participate in the process of assigned monitoring station, if the monitoring station number that all analysis stations are assigned all reaches
When MAX or can to distribute monitoring station number be zero, then end step S140.
Step S150, if there is the unassigned analysis station in monitoring station, then it is corresponding this monitoring station to be distributed into this monitoring station
All analysis stations in can be assigned the maximum analysis station of monitoring station number.
Specifically, a new list NJlist is created, list NJlist is used to store the institute for being not previously allocated analysis station
There is monitoring station, each monitoring station in selective listing NJlist proceeds as follows each monitoring station:
By taking a monitoring station as an example, J corresponding all analysis stations in monitoring station are searched from the dictionary J_DICT of monitoring station, for prison
The analysis station that survey station J is preferentially distributed is the maximum analysis station of monitoring station number that can be assigned.It can if there is two or more
The assigned identical analysis station of monitoring station number, then in the two or multiple identical analysis stations of monitoring station number being assigned
In select an analysis station at random and distribute to monitoring station J, and this analysis station is associated with monitoring station J.
Step S160, it is not allocated to monitoring station if there is analysis station FX, then distributes monitoring station for it.
Specifically, a new list NFlist is created, list NFlist is used to store all unassigned monitoring stations
Analysis station selects each analysis station in NFlist, carries out following operation to each analysis station FX in list NFlist:
Each monitoring station JC that can be assigned of analysis station FX is searched in analysis station dictionary F_DICT, search and each
Number maximum analysis station FA in monitoring station can be assigned in the associated analysis station of monitoring station JC, it will be with the associated monitoring station analysis station FA
Monitoring station JC is associated with by JC disassociation relationship with analysis station FX.
Step S170, the quantity for the monitoring station being assigned if there is analysis station is greater than MAX, will exceed the monitoring station of MAX
It is distributed once again.
Specifically, the monitoring station beyond MAX analysis station being assigned and this analysis station disassociation relationship, and jump to
Step S150, the monitoring station that will exceed MAX are distributed once again.Otherwise analysis station terminates with monitoring station assigning process, terminates whole
A distribution task.
By above step and on the basis of experimental data for several times, the Weighted random matching algorithm that reconciles be may insure finally
The assigned monitoring station number otherness of obtained each analysis station is smaller, and final allocation result is balanced.The present invention is
Ensure the equilibrium degree of allocation result by two aspects, first is that ensuring that allocation result is equal using Weighted random matching algorithm is reconciled
Weighing apparatus degree optimizes second is that being distributed once again by the monitoring station that will exceed MAX, to ensure again the equilibrium of allocation result
Degree.
Preferably, although the example of present invention reference is described, it is intended merely to the purpose explained rather than to this Shen
Limitation please, the change to embodiment, increase and/or deletion can be made without departing from scope of the present application.
Involved in these embodiments, from the description above with the technical staff in the field that is presented in associated attached drawing
The many modifications and other embodiments of the application recorded here will be recognized.It should therefore be understood that the application is not limited to public affairs
The specific embodiment opened, it is intended to be included within the scope of the following claims modification and other embodiments.Although
Specific term is employed herein, but only using them and not for the mesh of limitation on general significance and describing significance
And use.
Claims (10)
1. a kind of monitoring water environment algorithm, which comprises the steps of:
Step S110, monitoring station dictionary and analysis station dictionary are generated, monitoring station list and analysis station list are generated, setting is minimum
Number MIN and maximum number MAX；
Step S120, it is randomly assigned monitoring station for all analysis stations of the monitoring station number less than MIN can be assigned in analysis station list,
And the monitoring station of analysis station and distribution is associated, the list of replacement analysis station；
Step S130, updated analysis station list is handled, is arranged using Weighted random matching algorithm is reconciled for analysis station
Analysis station in table sequentially distributes monitoring station, is equal to the monitoring station quantity that each analysis station is assigned in analysis station list
MIN；
Step S140, the analysis station in analysis station list is continued as using reconciliation Weighted random matching algorithm sequentially distribute monitoring
It stands, the monitoring station quantity that each analysis station is assigned in analysis station list is made to be equal to MAX；
One monitoring station is only capable of being assigned to an analysis station, and an analysis station can be assigned to multiple monitoring stations.
2. monitoring water environment algorithm according to claim 1, which is characterized in that the reconciliation Weighted random matching algorithm is logical
Cross formulaThe probability that monitoring station is assigned to i-th of analysis station is calculated, is made according to probability selection analysis station
The target analysis station being assigned for the monitoring station；
Wherein, n represents the analysis station quantity that can distribute to certain monitoring station, and Ji represents the monitoring station that i-th of analysis station can be assigned
Quantity, Pi are the probability that the monitoring station is assigned to i-th of analysis station, and Jk represents the monitoring that k-th of analysis station can be assigned
It stands quantity.
3. monitoring water environment algorithm according to claim 1, which is characterized in that after step s 140, monitor if it exists
It stands unassigned analysis station, then monitoring station number can be assigned by distributing to this monitoring station in the corresponding all analysis stations in this monitoring station
Maximum analysis station.
4. monitoring water environment algorithm according to claim 1, which is characterized in that after step s 140, if it exists first
Analysis station is not assigned to monitoring station, then distributes monitoring station for it.
5. monitoring water environment algorithm according to claim 4, which is characterized in that search first point in analysis station dictionary
Each monitoring station that analysis station can be assigned searches and can be assigned monitoring station in associated second analysis station in each monitoring station
The maximum analysis station of number, as third analysis station, by the monitoring station and third analysis station disassociation relationship, by the monitoring
It stands and is associated with the first analysis station.
6. monitoring water environment algorithm according to claim 1, which is characterized in that after step s 140, if there is point
The quantity of the assigned monitoring station in analysis station is greater than MAX, and the monitoring station that will exceed MAX is distributed once again.
7. monitoring water environment algorithm according to claim 6, which is characterized in that exceed what the analysis station was assigned
The monitoring station of MAX and the analysis station disassociation relationship and then the monitoring station that will exceed MAX are distributed once again.
8. monitoring water environment algorithm according to claim 1, which is characterized in that minimum number MIN and maximum number MAX is used
As two boundary parameters for dividing entire algorithm.
9. monitoring water environment algorithm according to claim 1, which is characterized in that store monitoring station and can in the dictionary of monitoring station
The analysis station of monitoring station is distributed to, storage analysis station and the monitoring station that analysis station can be distributed in analysis station dictionary.
10. monitoring water environment algorithm according to claim 1, which is characterized in that monitoring station list is used to store unallocated
The monitoring station of analysis station, analysis station list are used to store the analysis station of unassigned full monitoring station.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910026846.5A CN109740819A (en) | 2019-01-11 | 2019-01-11 | A kind of monitoring water environment algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910026846.5A CN109740819A (en) | 2019-01-11 | 2019-01-11 | A kind of monitoring water environment algorithm |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109740819A true CN109740819A (en) | 2019-05-10 |
Family
ID=66364401
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910026846.5A Pending CN109740819A (en) | 2019-01-11 | 2019-01-11 | A kind of monitoring water environment algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109740819A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3321373A1 (en) * | 2011-07-13 | 2018-05-16 | T2 Biosystems, Inc. | Nmr methods for monitoring blood clot formation |
| CN108961113A (en) * | 2018-06-08 | 2018-12-07 | 广州番禺职业技术学院 | A kind of management system of putting into several classes based on colleges and universities' information platform |
-
2019
- 2019-01-11 CN CN201910026846.5A patent/CN109740819A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3321373A1 (en) * | 2011-07-13 | 2018-05-16 | T2 Biosystems, Inc. | Nmr methods for monitoring blood clot formation |
| CN108961113A (en) * | 2018-06-08 | 2018-12-07 | 广州番禺职业技术学院 | A kind of management system of putting into several classes based on colleges and universities' information platform |
Non-Patent Citations (1)
| Title |
|---|
| 苏海 彭彪: "GIS在水环境信息管理系统中的应用", 《人民长江》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10877974B2 (en) | Statistical identification of instances during reconciliation process | |
| KR102198680B1 (en) | Efficient data caching management in scalable multi-stage data processing systems | |
| US5644720A (en) | Interprocess communications interface for managing transaction requests | |
| JP4503647B2 (en) | Binary search tree with hooked duplicate values for memory allocation | |
| US8412899B2 (en) | Real time backup storage node assignment | |
| US8832173B2 (en) | System and method of multithreaded processing across multiple servers | |
| CN106233275A (en) | Data management system and method | |
| US8103824B2 (en) | Method for self optimizing value based data allocation across a multi-tier storage system | |
| Lin et al. | Ant colony optimization for unrelated parallel machine scheduling | |
| US10459906B2 (en) | Management of sparse data for database systems with multiple processing units | |
| GB2585890A (en) | System for distributed data processing using clustering | |
| US10761889B1 (en) | Systems and methods for autoscaling instance groups of computing platforms | |
| CN106681656A (en) | Dynamically-adjustable cloud storage system fault tolerance method | |
| CN108616424A (en) | A kind of resource regulating method, computer equipment and system | |
| Lwin et al. | Non-redundant dynamic fragment allocation with horizontal partition in Distributed Database System | |
| CN109740819A (en) | A kind of monitoring water environment algorithm | |
| CN111124619B (en) | Container scheduling method for secondary scheduling | |
| US20160342899A1 (en) | Collaborative filtering in directed graph | |
| CN108710687A (en) | A kind of acquisition methods and device of service identification sequence | |
| CN110868435A (en) | Bare metal server scheduling method and device and storage medium | |
| CN112035579B (en) | Graph management, data storage and data query methods, devices and storage medium | |
| US8201023B2 (en) | Test optimization | |
| CN109165325A (en) | Method, apparatus, equipment and computer readable storage medium for cutting diagram data | |
| KR20090065134A (en) | Distributed parallel job processing system and method | |
| CN112395119B (en) | Abnormal data processing method, device, server and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190510 |
|
| RJ01 | Rejection of invention patent application after publication |