CN103116599A - Urban mass data flow fast redundancy elimination method based on improved Bloom filter structure - Google Patents
Urban mass data flow fast redundancy elimination method based on improved Bloom filter structure Download PDFInfo
- Publication number
- CN103116599A CN103116599A CN2012105164704A CN201210516470A CN103116599A CN 103116599 A CN103116599 A CN 103116599A CN 2012105164704 A CN2012105164704 A CN 2012105164704A CN 201210516470 A CN201210516470 A CN 201210516470A CN 103116599 A CN103116599 A CN 103116599A
- Authority
- CN
- China
- Prior art keywords
- bfn
- data
- bfo
- bloom filter
- data stream
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
An urban mass data flow fast redundancy elimination method based on an improved Bloom filter structure comprises the steps of (1) dataset storage based on the Bloom filter structure, (2) a counting and storage method of massive dynamic datasets, (3) an acceleration processing mechanism of aging elements, (4) a dual-pointer dynamic control method, (5) new data insertion, (6) redundancy judgment of a new element, (7) data flow counting update, (8) periodical deletion of historical data, and (9) output of result data flow after redundancy optimization if no new arrival data. The urban mass data flow fast redundancy elimination method based on the improved Bloom filter structure facilitates urban administrative staff to process continuously rapid growing urban massive data flow quickly and efficiently.
Description
Technical field
The present invention relates to Intelligent Information Processing, space store compressed technical field knowledge, be specifically related to a kind of city high amount of traffic fast-speed redundancy removing method based on improving Bloom Filter structure.Be specially adapted to the city high amount of traffic problem that the processing of city management personnel quickness and high efficiency grows continuously and fast.
Background technology
Along with the development of computer technology and the widespread use of advanced computing technique, the Data Source form of required processing presents diversified characteristics, the large data environment that mass data arrives with swiftly flowing form has appearred in many professional domains, such as be widely used in urban traffic information, earthquake prediction, biosome reference breath detects and the sensor network of military information detection etc. produces detects continuously in a large number data.This new data mode has the features such as real-time, continuity, single pass, unlimitedness, and seeking the various emerging efficient data stream treatment technologies that are applicable to this field practice demand has become the focus that more and more researchers pay close attention to.
If exist the data object that had occurred just to be called the data stream redundancy in the data stream infinite sequence that arrives in real time.In the epoch that can continue automatically to produce a large amount of detail data, multiple magnanimity data stream type data at a high speed need to be carried out complex analyses in nearly real-time mode.And the data stream of redundancy not only can cause the waste of ample resources also directly to reduce the handling property of machine, thereby has affected largely the real-time analysis of the accuracy of this data stream.New data stream redundancy processing method need to adapt to magnanimity large data environment at a high speed, and coordinate Various types of data stream method for digging with the characteristic of low complex degree, high-accuracy, thereby produce the enlarge-effect of " 1+1〉2 ", make data stream obtain the analyzing and processing of real real-time high-efficiency.
Often need to solve following two large problems in research to the elimination of data stream redundancy.At first, traditional comparative approach line by line can not adapt to a large amount of groupings and concurrent data stream environment, and we must obtain all redundant recordings of data stream in single ergodic.Secondly, internal memory can not be processed all data streams, needs to adopt the method for window based in limited memory headroom, gets nearest one piece of data flowmeter calculation and obtains its approximation.Yet because the various data stream redundancy eliminating methods of the restriction of computational resource often reduce the complexity of method by the accuracy of sacrificing the redundancy elimination.The several data method for digging such as the classification under the high amount of traffic environment, cluster, Frequent Pattern Mining more pay attention to seeking optimum equilibrium point between counting yield and accuracy, raise the efficiency as much as possible under the prerequisite that rationally reduces redundancy elimination accuracy, make technology for eliminating can adapt to swiftly flowing high amount of traffic environment.
Summary of the invention
The present invention will overcome the shortcoming that existing Urban Data stream treatment capacity is large, redundance is high, the present invention proposes a kind of city high amount of traffic fast-speed redundancy removing method based on improving Bloom Filter structure, the city high amount of traffic that the processing of support city management personnel quickness and high efficiency grows continuously and fast.
The technical solution adopted for the present invention to solve the technical problems is:
A kind of city mass data flow fast-speed redundancy removing method based on improving Bloom Filter structure comprises the following steps:
1) store based on the data set of Bloom Filter structure: setting data stream is expressed as S
N=x
1, x
2..., x
n, N is the number of element in data stream, during original state, Bloom Filter is a bit array that comprises the m position, each all is set to 0, and is as follows: b[i]=0, i=0...m-1; Bloom Filter uses k separate hash function, each element map during they will gathers respectively to (1 ..., in scope m), to any one element x, the position that i hash function shines upon will be set to 1, i.e. h
i(x)=1,1≤i≤k;
2) magnanimity dynamic data set counting storage means: each of standard Bloom Filter bit array is expanded to a little counter, add respectively 1 for when inserting element the value of k corresponding Counter, subtract respectively 1 for the value of k corresponding Counter when the deletion element:
3) aging element accelerates treatment mechanism: adopt the jump window scheme of former and later two count windows, at first define two BF structures, namely
BFO[1,...,m]
BFN[1,...,m]
The array that each structure is comprised of m integer;
Definition hash function f
1, f
2..., f
kK Hash maps for BF; Suppose that w is the aging count value of data stream, BFO represents that last interval is the interior counting mapping of [1, w] scope, and after the BFN representative, an interval is the counting mapping in [w+1,2w] scope;
4) two pointer dynamic control methods: adopt the method for two dynamic pointers, pointer can indicate current count value in the moving section of BFO and BFN, and is current count tag of each distribution of flows, pointer p
iPossess [1, w] between effective count block;
5) new data inserts: when new element x is arranged
iWhen needing to insert, will first respectively carry out k time Hash maps on BFO and BFN, calculate respective value, according to the respective value of new data on BFO and BFN, calculate its corresponding minimum value:
v=min(v
1,v
2,...,v
k)
6) judge whether redundancy of new element: according to the minimum value that back calculates, if minimum value v=0 corresponding to BFN, judge that this element did not occur in the corresponding operation interval of BFN; If the minimum value v that BFO is corresponding<p1 represents that this element did not occur yet in last operation interval; If new element x
iBoth do not occur in BFO, do not occur in BFN yet, and added this new element, otherwise abandon this redundant elements;
7) update data stream counting: be arranged to current pointer counter value for k position corresponding to this data stream in BFN, i.e. b[i]=p2;
8) regular deleting history data: when dynamic pointer p1 reaches critical value w, represent that this data stream has become aging stream, therefore delete BFO, and replacing BFO and BFN, make BFO continue to keep the data stream mapping of a upper operation interval, BFN preserves the data stream mapping in work at present interval, the p of initialization simultaneously
i=1;
9) if after arriving port redundancy optimization without new data, result data flows.
Technical conceive of the present invention is: we eliminate problem at data stream redundancy.Introduce improved Bloom Filter data structure, take into full account the features such as data stream real-time, continuity, single pass, unlimitedness, propose a kind of city mass data flow fast-speed redundancy removing method based on improving Bloom Filter structure.Eliminate problem by the redundancy under the scientific and reasonable solution high amount of traffic environment of the method.
Beneficial effect of the present invention is mainly manifested in: the redundancy that effectively solves under the high amount of traffic environment is eliminated problem.
Description of drawings
Fig. 1 is Bloom Filter structured data storage schematic diagram;
Fig. 2 is Counting Bloom Filter dynamic data set method of counting figure;
Fig. 3 is based on the city mass data flow fast-speed redundancy removing method that improves Bloom Filter structure.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
With reference to Fig. 1~Fig. 3, a kind of city mass data flow fast-speed redundancy removing method based on improving Bloom Filter structure comprises the following steps:
1) store based on the data set of Bloom Filter structure: tentation data stream can be expressed as S
N=x
1, x
2..., x
n, N is the number of element in data stream, N often tends to and infinity in real world.Bloom Filter is the very high random data storage organization of a kind of space efficiency, under the application scenario that can tolerate low error rate, Bloom Filter has exchanged the very big saving of storage space for by few mistake, obtained using very widely in reality.
During original state, Bloom Filter is a bit array that comprises the m position, and each all is set to 0, and is as follows: b[i]=0, i=0...m-1.
In order to express S={x
1, x
2..., x
nThe set of such n element, Bloom Filter uses k separate hash function (Hash Function), each element map during they will gathers respectively arrive (1 ..., in scope m).To any one element x, the position of i hash function mapping will be set to 1, i.e. h
i(x)=1,1≤i≤k.Specifically as shown in Figure 1.
2) magnanimity dynamic data set counting storage means: the large data under real urban environment have the features such as real-time, continuity, single pass, unlimitedness.Simple Bloom Filter data store organisation can not satisfy the needs of reality.And Counting Bloom Filter can address this problem.Each of standard Bloom Filter bit array is expanded to a little counter (Counter, be generally each Counter and distribute 4), giving corresponding k(k when inserting element is the hash function number) value of individual Counter adds respectively 1, subtracts respectively 1 for the value of k corresponding Counter when the deletion element.
Counter Bloom Filter method has increased deletion action for Bloom Filter by taking the cost of more storage space.Example is seen accompanying drawing 2.
3) aging element accelerates treatment mechanism: when deleting aging element based on the way of moving window (sliding window) general modfel, need the whole BF structure of real time scan, for fear of the performance cost of bringing with this, this method adopts jump window (jumping window) pattern of former and later two count windows.At first this method defines two BF structures, namely
BFO[1,...,m]
BFN[1,...,m]
The array that each structure is comprised of m integer.
Definition hash function f
1, f
2..., f
kK Hash maps for BF.Suppose that w is the aging count value of data stream, BFO represents that last interval is the interior counting mapping of [1, w] scope, and after the BFN representative, an interval is the counting mapping in [w+1,2w] scope.
4) two pointer dynamic control methods: existing data stream redundancy eliminating method is the higher problem of life period complexity all, and for this situation, the present invention has adopted the method for two dynamic pointers.Pointer can indicate current count value in the moving section of BFO and BFN, and is current count tag of each distribution of flows.Pointer p
iPossess [1, w] between effective count block, therefore, but this method formalization representation is the form of accompanying drawing 3.
5) new data inserts: when new element x is arranged
iWhen needing to insert, this method will first respectively be carried out k time Hash maps on BFO and BFN, calculate respective value.According to the respective value of new data on BFO and BFN, calculate its corresponding minimum value:
v=min(v
1,v
2,...,v
k)
6) judge whether redundancy of new element: according to the minimum value that back calculates, if minimum value v=0 corresponding to BFN, judge that this element did not occur in the corresponding operation interval of BFN.If the minimum value v that BFO is corresponding<p1 represents that this element did not occur yet in last operation interval.If new element x
iBoth do not occur in BFO, do not occur in BFN yet, and added this new element, otherwise abandon this redundant elements.
7) update data stream counting: be arranged to current pointer counter value for k position corresponding to this data stream in BFN, i.e. b[i]=p2.
8) regular deleting history data: in order to distinguish historical data and the current data in data stream, this method has been introduced two BF structures, therefore when dynamic pointer p1 reaches critical value w, represents that this data stream has become aging stream.Therefore delete BFO, and change BFO and BFN, the data stream mapping that makes BFO continue to keep a upper operation interval, BFN preserves the data stream mapping in work at present interval.The p of initialization simultaneously
i=1.
9) if after arriving port redundancy optimization without new data, result data flows.
Claims (1)
1. one kind based on the city mass data flow fast-speed redundancy removing method that improves Bloom Filter structure, it is characterized in that: comprise the following steps:
1) store based on the data set of Bloom Filter structure: setting data stream is expressed as
S
N=x
1, x
2..., x
n, N is the number of element in data stream, during original state, Bloom Filter is a bit array that comprises the m position, each all is set to 0, and is as follows: b[i]=0, i=0...m-1; Bloom Filter uses k separate hash function, each element map during they will gathers respectively to (1 ..., in scope m), to any one element x, the position that i hash function shines upon will be set to 1, i.e. h
i(x)=1,1≤i≤k;
2) magnanimity dynamic data set counting storage means: each of standard Bloom Filter bit array is expanded to a little counter, add respectively 1 for when inserting element the value of k corresponding Counter, subtract respectively 1 for the value of k corresponding Counter when the deletion element:
3) aging element accelerates treatment mechanism: adopt the jump window scheme of former and later two count windows, at first define two BF structures, namely
BFO[1,...,m]
BFN[1,...,m]
The array that each structure is comprised of m integer;
Definition hash function f
1, f
2..., f
kK Hash maps for BF; Suppose that w is the aging count value of data stream, BFO represents that last interval is the interior counting mapping of [1, w] scope, and after the BFN representative, an interval is the counting mapping in [w+1,2w] scope;
4) two pointer dynamic control methods: adopt the method for two dynamic pointers, pointer can indicate current count value in the moving section of BFO and BFN, and is current count tag of each distribution of flows, pointer p
iPossess [1, w] between effective count block;
5) new data inserts: when new element x is arranged
iWhen needing to insert, will first respectively carry out k time Hash maps on BFO and BFN, calculate respective value, according to the respective value of new data on BFO and BFN, calculate its corresponding minimum value:
v=min(v
1,v
2,...,v
k)
6) judge whether redundancy of new element: according to the minimum value that back calculates, if minimum value v=0 corresponding to BFN, judge that this element did not occur in the corresponding operation interval of BFN; If the minimum value v that BFO is corresponding<p1 represents that this element did not occur yet in last operation interval; If new element x
iBoth do not occur in BFO, do not occur in BFN yet, and added this new element, otherwise abandon this redundant elements;
7) update data stream counting: be arranged to current pointer counter value for k position corresponding to this data stream in BFN, i.e. b[i]=p2;
8) regular deleting history data: when dynamic pointer p1 reaches critical value w, represent that this data stream has become aging stream, therefore delete BFO, and replacing BFO and BFN, make BFO continue to keep the data stream mapping of a upper operation interval, BFN preserves the data stream mapping in work at present interval, the p of initialization simultaneously
i=1;
9) if after arriving port redundancy optimization without new data, result data flows.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2012105164704A CN103116599A (en) | 2012-11-30 | 2012-11-30 | Urban mass data flow fast redundancy elimination method based on improved Bloom filter structure |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN2012105164704A CN103116599A (en) | 2012-11-30 | 2012-11-30 | Urban mass data flow fast redundancy elimination method based on improved Bloom filter structure |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103116599A true CN103116599A (en) | 2013-05-22 |
Family
ID=48414973
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN2012105164704A Pending CN103116599A (en) | 2012-11-30 | 2012-11-30 | Urban mass data flow fast redundancy elimination method based on improved Bloom filter structure |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103116599A (en) |
Cited By (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103279532A (en) * | 2013-05-31 | 2013-09-04 | 北京鹏宇成软件技术有限公司 | Filtering system and filtering method for removing duplication of elements of multiple sets and identifying belonged sets |
CN103929361A (en) * | 2014-04-18 | 2014-07-16 | 宁波大学 | Method for Bloom filter correlation deletion |
WO2015027731A1 (en) * | 2013-08-28 | 2015-03-05 | 华为技术有限公司 | Bloom filter generation method and device |
CN105938480A (en) * | 2016-04-07 | 2016-09-14 | 重庆大学 | RFID redundant data cleansing method and system based on DTBF |
CN106844561A (en) * | 2016-12-30 | 2017-06-13 | 重庆大学 | A kind of RFID redundant data cleaning strategies based on R TBF |
CN107798042A (en) * | 2016-08-29 | 2018-03-13 | 北京大学 | A kind of data processing method and Frequency estimation method based on two-layer configuration outside piece inner sheet |
CN107888415A (en) * | 2017-11-03 | 2018-04-06 | 北京佳讯飞鸿电气股份有限公司 | A kind of network management system data maintaining method |
CN108334520A (en) * | 2017-01-19 | 2018-07-27 | 北京京东尚科信息技术有限公司 | social network data processing method, device, storage medium and electronic equipment |
CN109361686A (en) * | 2018-11-16 | 2019-02-19 | 重庆邮电大学 | A kind of compression method reducing sensing data time redundancy |
CN109408572A (en) * | 2018-09-30 | 2019-03-01 | 南京联创信息科技有限公司 | Mass data processing method based on SB frame and Bloom filter |
CN109766479A (en) * | 2019-01-24 | 2019-05-17 | 北京三快在线科技有限公司 | Data processing method, device, electronic equipment and storage medium |
CN109815234A (en) * | 2018-12-29 | 2019-05-28 | 杭州中科先进技术研究院有限公司 | A kind of multiple cuckoo filter under streaming computing model |
WO2021035843A1 (en) * | 2019-08-28 | 2021-03-04 | 东北大学 | Seismic network big data deduplication method based on bloom filter algorithm |
CN112528685A (en) * | 2020-12-10 | 2021-03-19 | 南京航空航天大学 | RFID data redundancy processing method based on dynamic additional bloom filter |
CN112699323A (en) * | 2021-01-07 | 2021-04-23 | 西藏宁算科技集团有限公司 | Cloud caching system and cloud caching method based on double bloom filters |
US11741258B2 (en) | 2021-04-16 | 2023-08-29 | International Business Machines Corporation | Dynamic data dissemination under declarative data subject constraints |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101923568A (en) * | 2010-06-23 | 2010-12-22 | 北京星网锐捷网络技术有限公司 | Method for increasing and canceling elements of Bloom filter and Bloom filter |
US20120102003A1 (en) * | 2010-10-20 | 2012-04-26 | International Business Machines Corporation | Parallel data redundancy removal |
-
2012
- 2012-11-30 CN CN2012105164704A patent/CN103116599A/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101923568A (en) * | 2010-06-23 | 2010-12-22 | 北京星网锐捷网络技术有限公司 | Method for increasing and canceling elements of Bloom filter and Bloom filter |
US20120102003A1 (en) * | 2010-10-20 | 2012-04-26 | International Business Machines Corporation | Parallel data redundancy removal |
Non-Patent Citations (2)
Title |
---|
严华云,关佶红: "Bloom Filter研究进展", 《电信科学》 * |
唐海娜 等: "基于移动指针的数据流冗余消除算法", 《通信学报》 * |
Cited By (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103279532A (en) * | 2013-05-31 | 2013-09-04 | 北京鹏宇成软件技术有限公司 | Filtering system and filtering method for removing duplication of elements of multiple sets and identifying belonged sets |
CN103279532B (en) * | 2013-05-31 | 2016-12-28 | 北京创世泰克科技股份有限公司 | Many set elements duplicate removal also identifies the affiliated filtration system gathered and method thereof |
WO2015027731A1 (en) * | 2013-08-28 | 2015-03-05 | 华为技术有限公司 | Bloom filter generation method and device |
US10664445B2 (en) | 2013-08-28 | 2020-05-26 | Huawei Technologies Co., Ltd. | Bloom filter generation method and apparatus |
CN103929361B (en) * | 2014-04-18 | 2017-05-10 | 宁波大学 | Method for Bloom filter correlation deletion |
CN103929361A (en) * | 2014-04-18 | 2014-07-16 | 宁波大学 | Method for Bloom filter correlation deletion |
CN105938480A (en) * | 2016-04-07 | 2016-09-14 | 重庆大学 | RFID redundant data cleansing method and system based on DTBF |
CN107798042A (en) * | 2016-08-29 | 2018-03-13 | 北京大学 | A kind of data processing method and Frequency estimation method based on two-layer configuration outside piece inner sheet |
CN107798042B (en) * | 2016-08-29 | 2021-07-06 | 北京大学 | Data processing method and frequency estimation method based on-chip and off-chip two-stage structure |
CN106844561A (en) * | 2016-12-30 | 2017-06-13 | 重庆大学 | A kind of RFID redundant data cleaning strategies based on R TBF |
CN106844561B (en) * | 2016-12-30 | 2020-03-24 | 重庆大学 | R-TBF-based RFID (radio frequency identification) redundant data cleaning method |
CN108334520A (en) * | 2017-01-19 | 2018-07-27 | 北京京东尚科信息技术有限公司 | social network data processing method, device, storage medium and electronic equipment |
CN107888415B (en) * | 2017-11-03 | 2020-11-13 | 北京佳讯飞鸿电气股份有限公司 | Network management system data maintenance method |
CN107888415A (en) * | 2017-11-03 | 2018-04-06 | 北京佳讯飞鸿电气股份有限公司 | A kind of network management system data maintaining method |
CN109408572A (en) * | 2018-09-30 | 2019-03-01 | 南京联创信息科技有限公司 | Mass data processing method based on SB frame and Bloom filter |
CN109361686A (en) * | 2018-11-16 | 2019-02-19 | 重庆邮电大学 | A kind of compression method reducing sensing data time redundancy |
CN109815234A (en) * | 2018-12-29 | 2019-05-28 | 杭州中科先进技术研究院有限公司 | A kind of multiple cuckoo filter under streaming computing model |
CN109766479A (en) * | 2019-01-24 | 2019-05-17 | 北京三快在线科技有限公司 | Data processing method, device, electronic equipment and storage medium |
CN109766479B (en) * | 2019-01-24 | 2020-06-09 | 北京三快在线科技有限公司 | Data processing method and device, electronic equipment and storage medium |
WO2021035843A1 (en) * | 2019-08-28 | 2021-03-04 | 东北大学 | Seismic network big data deduplication method based on bloom filter algorithm |
CN112528685A (en) * | 2020-12-10 | 2021-03-19 | 南京航空航天大学 | RFID data redundancy processing method based on dynamic additional bloom filter |
CN112528685B (en) * | 2020-12-10 | 2022-04-08 | 南京航空航天大学 | RFID data redundancy processing method based on dynamic additional bloom filter |
CN112699323A (en) * | 2021-01-07 | 2021-04-23 | 西藏宁算科技集团有限公司 | Cloud caching system and cloud caching method based on double bloom filters |
US11741258B2 (en) | 2021-04-16 | 2023-08-29 | International Business Machines Corporation | Dynamic data dissemination under declarative data subject constraints |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103116599A (en) | Urban mass data flow fast redundancy elimination method based on improved Bloom filter structure | |
CN108010103A (en) | The quick fine generation method of river with complicated landform | |
Arge et al. | External-memory algorithms for processing line segments in geographic information systems | |
CN107832876B (en) | Partition maximum load prediction method based on MapReduce framework | |
Chen et al. | Distributed modeling in a MapReduce framework for data-driven traffic flow forecasting | |
CN102479217B (en) | Method and device for realizing computation balance in distributed data warehouse | |
CN106126601A (en) | A kind of social security distributed preprocess method of big data and system | |
CN104461551A (en) | Parallel data processing based big data processing system | |
CN103440246A (en) | Intermediate result data sequencing method and system for MapReduce | |
CN109033340A (en) | A kind of searching method and device of the point cloud K neighborhood based on Spark platform | |
CN104112053A (en) | Design method of reconfigurable architecture platform oriented image processing | |
CN103345496A (en) | Multimedia information searching method and system | |
CN102495888B (en) | Parallel digital terrain analysis oriented data splitting and distributing method | |
CN105095255A (en) | Data index creating method and device | |
CN114329663B (en) | Slope unit dividing method based on scale of historical geological disasters | |
CN107679127A (en) | Point cloud information parallel extraction method and its system based on geographical position | |
CN102446342A (en) | Reconfigurable binary arithmetical unit, reconfigurable binary image processing system and basic morphological algorithm implementation method thereof | |
WO2020118928A1 (en) | Distributed time sequence pattern retrieval method for massive equipment operation data | |
Ding et al. | Real-time trajectory similarity processing using longest common subsequence | |
CN107679133B (en) | Mining method applicable to massive real-time PMU data | |
CN112463739A (en) | Data processing method and system based on ocean mode ROMS | |
CN112200310B (en) | Intelligent processor, data processing method and storage medium | |
CN108170837A (en) | Method of Data Discretization, device, computer equipment and storage medium | |
CN110675470B (en) | Contour line drawing method and device, computing equipment and readable storage medium | |
CN103605631A (en) | Increment learning method on the basis of supporting vector geometrical significance |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130522 |