PATENT CLAIM ANALYSIS

Application Number: 16056045
Application Type: Utility
Filing Date: 2018-08
Publication Date: 2019-02
Patent Classification: ["719", "331000"]

Abstract:
The present invention discloses an automatic loading system and method for service functions of a hydraulic machine. The loading system includes an acquiring portion for acquiring i service function component chains of a hydraulic machine, a determining portion for determining a demand sequence of the service function component chains used by a user within each preset time period in a measuring cycle based on the acquired service function component chains and a deciding portion for automatically loading a service function of the hydraulic machine in a next moment according to the demand sequence based on a current input operation command of the user. By adopting the automatic loading system or method provided by the present invention, response speed of intelligent services of the hydraulic machine can be improved.

Claim (Index 15):
The automatic loading method according to  claim 12 , wherein a step of building a demand matrix of the i service function component chains in the measuring cycle according to the entire information entropy specifically comprises:\n judging whether the entire information entropy is less than 0.5, to obtain a first judging result: determining that a demand of the user for the service function component chains within the preset time period is a centralized demand if the first judging result indicates that the entire information entropy is less than 0.5, wherein a centralized vector of the centralized demand is {CC 1 =0, CC 2 =0, CC 3 =0 . . . , CC max =1}; CC max =max{P CC 1 , P CC 2 , . . . , P CCi }; CC i  is the service function component chain and P CCi  is the single probability of each of the service function component chains; determining that a demand of the user for the service function component chains within the preset time period is a disperse demand if the first judging result indicates that the entire information entropy is not less than 0.5, wherein a disperse vector of the disperse demand is {CC 1 =P CC 1 , CC 2 =P CC 2 , CC 3 =P CC 3  . . . , CC i =P cc i }; and building a demand matrix of the i service function component chains according to the centralized vector and the disperse vector.

Metadata:
- Claim Count in Document: 13.0
- Percentile: 96.0
- Lexical Diversity: 2.04615
- Patent Class: 719.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['14795225', '15123792', '16049298', '15441139', '15547528']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4907382814028635
- 35 USC 102 Novelty (BERT): 0.4894510297708026
- Combined Prediction Score: 0.4906095562396574
- Mean Citation Score: 125.90885320000002
- Max Citation Score: 131.14052
- Similarity Product: 81.07770628169061

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