PATENT CLAIM ANALYSIS

Application Number: 15938845
Application Type: Utility
Filing Date: 2018-03
Publication Date: 2018-08
Patent Classification: ["709", "216000"]

Abstract:
Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Claim (Index 24):
The computer-readable storage medium according to  claim 21 , wherein the determining, by using a random function, whether the at least a part of data in the window W iz [k i \u2212A z , k i +B z ] meets the preset condition C z  specifically comprises:\n selecting F bytes in the window W iz [k i \u2212A z , k i +B z ], and using the F bytes repeatedly H times to obtain F*H bytes in total, wherein F\u22651, each byte is formed by 8 bits, which are denoted as a m,1 , . . . , and a m,8 , representing the 1st bit to the 8th bit of an mth byte in the F*H bytes, bits corresponding to the F*H bytes can be represented as: \u2003 ( a 1 , 1 a 1 , 2 \u2026 a 1 , 8 a 2 , 1 a 2 , 2 \u2026 a 2 , 8 M M M M a F * H , 1 a F * H , 2 \u2026 a F * H , 8 ) , wherein when a m,n =1, V am,n , =1, and when a m,n =0, V am,n =\u22121, wherein a m,n  represents any one of a m,1 , . . . , and a m,8 , a matrix V a  is obtained according to a conversion relationship between a m,n  and V am,n , from the bits corresponding to the F*H bytes, the matrix V a  is represented as: ( V a \ue89e \ue89e 1 , 1 V a \ue89e \ue89e 1 , 2 \u039b V a \ue89e \ue89e 1 , 8 V a \ue89e \ue89e 2 , 1 V a \ue89e \ue89e 2 , 2 \u039b V a \ue89e \ue89e 2 , 8 M M M M V a \ue89e \ue89e F * H , 1 V a \ue89e \ue89e F * H , 2 \u039b V a \ue89e \ue89e F * H , 8 ) , F*H*8 random numbers are selected from random numbers following normal distribution to form a matrix R, the matrix R is represented as: \u2003 ( h 1 , 1 h 1 , 2 \u2026 h 1 , 8 h 2 , 1 h 2 , 2 \u2026 h 2 , 8 M M M M h F * H , 1 h F * H , 2 \u2026 h F * H , 8 ) , random numbers in an mth row of the matrix V a  and an mth row of the matrix R are multiplied and products are added to obtain a value, which is specifically represented as S am =V am,1 *h m,1 +V am2 *h m2 + . . . +V am,8 *h m,8 , S a1 , S a2 , . . . , and S aF*H  are obtained in a same way, a quantity K of values greater than 0 among S a1 , S a2 , . . . , and S af*H  is counted, and when K is an even number, the at least a part of data in the window W iz [k i \u2212A z , k i +B z ] meets the preset condition C z .

Metadata:
- Claim Count in Document: 62.0
- Percentile: 90.0
- Lexical Diversity: 1.94545
- Patent Class: 709.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['15235378', '15235407', '16318691', '15329990', '13981163']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3266039152553003
- 35 USC 102 Novelty (BERT): 0.5817396942505579
- Combined Prediction Score: 0.3521174931548261
- Mean Citation Score: 302.33828
- Max Citation Score: 491.63516
- Similarity Product: 473.578137377038

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test