Legal claims defining the scope of protection, as filed with the USPTO.
1. An information pushing method, the method comprising: acquiring a push instruction, the push instruction comprising: to-be-pushed information, a category of the to-be-pushed information, a planned push time of the to-be-pushed information and a push interval of the to-be-pushed information; acquiring information about at least one candidate push user with a category of push information same as the category of the to-be-pushed information, the information about a candidate push user comprising: the category of the push information, a planned push time of the push information, the push information being pushed to the candidate push user at the planned push time of the push information, a push interval of the push information, and a push status; selecting, based on the push instruction and the information about the at least one candidate push user, at least one to-be-pushed user, the at least one to-be-pushed user being at least one candidate push user not receiving the push information in a time length, a starting point of the time length being one push interval preceding the planned push time of the to-be-pushed information, and an ending point being a push interval succeeding the planned push time of the to-be-pushed information; and pushing the to-be-pushed information to the at least one to-be-pushed user.
4. The method according to claim 1 , wherein after the acquiring information about at least one candidate push user with a category of push information same as the category of the to-be-pushed information, the method further comprises: updating, based on the push instruction, information about the at least one to-be-pushed user, wherein the information about the at least one to-be-pushed user comprises: the category of the push information, the planned push time of the push information, the push interval of the push information, and the push status.
5. The method according to claim 4 , wherein after the pushing the to-be-pushed information to the at least one to-be-pushed user, the method further comprises: updating, based on the push instruction, the information about the at least one to-be-pushed user, wherein the information about the at least one to-be-pushed user comprises: the category of the push information, the planned push time of the push information, the push interval of the push information, and the push status.
6. An information pushing device, the device comprising: at least one processor; and a memory storing instructions, the instructions when executed by the at least one processor, cause the at least one processor to perform operations, the operations comprising: acquiring a push instruction, the push instruction comprising: to-be-pushed information, a category of the to-be-pushed information, a planned push time of the to-be-pushed information and a push interval of the to-be-pushed information; acquiring information about at least one candidate push user with a category of push information same as the category of the to-be-pushed information, the information about a candidate push user comprising: the category of the push information, a planned push time of the push information, the push information being pushed to the candidate push user at the planned push time of the push information, a push interval of the push information, and a push status; selecting, based on the push instruction and the information about the at least one candidate push user, at least one to-be-pushed user, the at least one to-be-pushed user being at least one candidate push user not receiving the push information in a time length, a starting point of the time length being one push interval preceding the planned push time of the to-be-pushed information, and an ending point being a push interval succeeding the planned push time of the to-be-pushed information; and pushing the to-be-pushed information to the at least one to-be-pushed user.
9. The device according to claim 6 , wherein the operations further comprise: updating, based on the push instruction, information about the at least one to-be-pushed user, wherein the information about the at least one to-be-pushed user comprises: the category of the push information, the planned push time of the push information, the push interval of the push information, and the push status.
10. The device according to claim 9 , wherein the operations further comprise: updating, based on the push instruction, the information about the at least one to-be-pushed user, wherein the information about the at least one to-be-pushed user comprises: the category of the push information, the planned push time of the push information, the push interval of the push information, and the push status.
11. A non-transitory computer storage medium storing a computer program, wherein the computer program, when executed by a processor, cause the processor to perform operations, the operations comprising: acquiring a push instruction, the push instruction comprising: to-be-pushed information, a category of the to-be-pushed information, a planned push time of the to-be-pushed information and a push interval of the to-be-pushed information; acquiring information about at least one candidate push user with a category of push information same as the category of the to-be-pushed information, the information about a candidate push user comprising the category of the push information, a planned push time of the push information, the push information being pushed to the candidate push user at the planned push time of the push information, a push interval of the push information, and a push status; selecting, based on the push instruction and the information about the at least one candidate push user, at least one to-be-pushed user, the at least one to-be-pushed user being at least one candidate push user not receiving the push information in a time length, a starting point of the time length being one push interval preceding the planned push time of the to-be-pushed information, and an ending point being a push interval succeeding the planned push time of the to-be-pushed information; and pushing the to-be-pushed information to the at least one to-be-pushed user.
12. The method according to claim 2 , wherein the method further comprises: for each candidate push user in the at least one candidate push user, determining the candidate push user as the to-be-pushed user in response to a screening value of the candidate push user not existing.
Unknown
June 15, 2021
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.