PATENT CLAIM ANALYSIS

Application Number: 16231711
Application Type: Utility
Filing Date: 2018-12
Publication Date: 2019-04
Patent Classification: ["717", "143000"]

Abstract:
In a dynamic computing environment, it is a nontrivial task to verify code running in the environment because most approaches to software similarity require extensive and time-consuming analysis of a binary, or the approaches fail to recognize executables that are similar but nonidentical. A biosequence-based method for quantifying similarity of executable binaries is used to identify allowed codes in a real-world multi-user environment.

Claim (Index 20):
The system of  claim 12  wherein the algorithm utilizes a master/workers/tasks concept, wherein tasks are given by a master to worker cores, wherein at startup, the master opens a query file and waits for requests, the worker cores allocate memory to run local Smith-Waterman calculations, wherein each worker core on a node allocates memory one at a time, and if there is not enough memory remaining, the worker cores that come online later do not allocate memory or run, further wherein as soon as a worker core allocates memory, the worker core requests a task from the master without waiting for other worker cores to allocate memory.

Metadata:
- Claim Count in Document: 33.0
- Percentile: 98.0
- Lexical Diversity: 1.31373
- Patent Class: 717.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15130837', '13784245', '10381683', '15479928', '11378913']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3560130826333657
- 35 USC 102 Novelty (BERT): 0.5674127917196367
- Combined Prediction Score: 0.3771530535419928
- Mean Citation Score: 174.578893
- Max Citation Score: 439.2748
- Similarity Product: 285.3812264420271

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

Dataset: test