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 9):
A server for searching for a data stream dividing point for dividing data into a plurality of portions, comprising:\n a central processing unit and a primary memory, the central processing unit communicates with the primary memory to execute computer instructions stored therein to perform the steps of: determining a window W x [k\u2212A x , k+B x ] and a preset condition C x  corresponding to the window W x [k\u2212A x , k+B x ] based on a dividing rule, wherein x indicates consecutive natural numbers from 1 to M, M\u22652, and A x  and B x  are integers for establishing a potential dividing point k, wherein the server comprises determining a corresponding window W iz [k i \u2212A z , k i +B z ] for a current potential dividing point k based on the dividing rule, wherein i and z are integers, and 1\u2264z\u2264M; determining whether at least a part of data in the window W iz [k i \u2212A z , k i +B z ] meets a preset condition C z ; when the at least a part of data in the window W iz [k i \u2212A z , k i +B z ] does not meet the preset condition C z , skipping N minimum units U for searching for a data stream dividing point from the current potential dividing point k i  along a direction of searching for a data stream dividing point, wherein N*U is not greater than \u2225B z \u2225+max x (\u2225A x \u2225), so as to obtain a new potential dividing point; and when at least a part of data in each window W ix [k i \u2212A x , k i +B x ] of M windows of the current potential dividing point k i  meets the preset condition C x , dividing the data stream at the current potential dividing point k i .

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.302142722113597
- 35 USC 102 Novelty (BERT): 0.5764661203185402
- Combined Prediction Score: 0.3295750619340913
- Mean Citation Score: 302.33828
- Max Citation Score: 491.63516
- Similarity Product: 457.13375812262535

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