PATENT CLAIM ANALYSIS

Application Number: 15959041
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-08
Patent Classification: ["370", "257000"]

Abstract:
A communications network comprises a plurality of participants. A first participant transmits a message repeating sequence of N≥2 successive messages to a second participant. An action which can be performed by the second participant is assigned to each message in the sequence. The first participant begins to transmit one of the N messages at N successive transmission times T_I (I=0, . . . , N−1). Each of the N messages contains a field defining a waiting time assigned to the respective message W _ I=T _( N −1)− T _ I+ΔW _ I  ( I =0, . . . , N −1), where ΔW_I is a non-negative tolerance time. The second participant selects one message from among the messages in the sequence which are successfully received by the second participant as a useful message, measures a time elapsed since reception of the useful message, and performs the action assigned to the useful message when the elapsed time has reached the assigned waiting time.

Claim (Index 9):
The method according to  claim 1 , wherein the messages in the message repeating sequence are processed by the participants in passing.

Metadata:
- Claim Count in Document: 8.0
- Percentile: 91.0
- Lexical Diversity: 2.16867
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['14426119', '12348112', '11314556', '11343143', '10666793']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5514258041717812
- 35 USC 102 Novelty (BERT): 0.4774316714909699
- Combined Prediction Score: 0.5440263909037001
- Mean Citation Score: 158.255968
- Max Citation Score: 162.67111
- Similarity Product: 114.19287332684635

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

Dataset: test