8600981

Using Activity Status to Adjust Activity Rankings

PublishedDecember 3, 2013
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
15 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A computer-implemented method, comprising: receiving a time-related signal for a given activity, the given activity stored in a global activity database that comprises data defining a plurality of activities, wherein the data for the given activity is associated with one or more global parameters, the global parameters comprising a timing-related priority, and wherein the time-related signal is related to at least one time-related parameter of the one or more global parameters, wherein the time-related signal for the given activity includes a signal for modifying the timing-related priority of the given activity, wherein the time-related signal includes a second signal for establishing a baseline for the timing-related priority of the given activity; determining a completion of the given activity based on the time-related signal; modifying a time-period parameter of the given activity based on determining the completion of the given activity, wherein the time-period parameter comprises a period of time between periodically occurring activities; updating the timing-related priority of the given activity based on the time-related signal; determining a subset of the plurality of activities as being related to the given activity based on one or more respective global parameters, the subset including the given activity; determining a rank for the one or more determined activities based at least in part on the timing-related priority; selecting an activity list from the ranked subset of the plurality of activities based on the ranks of activities in the determined subset of the plurality of activities; generating an activity list display of the activity list; storing a first time corresponding to the completion of the given activity; determining if a second time indicating a prior completion of the given activity exists; determining an elapsed period of time from the second time to the first time if the second time exists; and scheduling a future time for the given activity based on the determined elapsed period of time from the second time to the first time.

2

2. The method of claim 1 , wherein the time-related signal includes a completion signal indicating that the given activity has been completed.

3

3. The method of claim 2 , wherein updating the timing-related priority of the given activity is responsive to the completion signal.

4

4. The method of claim 1 , wherein the time-related signal includes a second signal for indicating a time to perform the given activity.

5

5. The method of claim 4 , wherein the second signal for indicating the time to perform the given activity schedules the given activity at a fixed period of time in the future.

6

6. The method of claim 1 , wherein the time-related signal includes a second signal for indicating an amount of time to delay performing the given activity.

7

7. The method of claim 6 , wherein the second signal for indicating the amount of time to delay performing the given activity comprises an indeterminate amount of time.

8

8. The method of claim 1 , wherein the time-related parameter comprises the time-period parameter for a periodic activity, wherein the periodic activity includes one or more recurring activities based on a periodic time period.

9

9. The method of claim 8 , wherein the time-period parameter is based on a record of reception times of one or more time-related signals.

10

10. The method of claim 9 , wherein the one or more time-related signals are respective signals indicating respective completion times of the one or more recurring activities.

11

11. The method of claim 1 , wherein determining the rank for each activity is further based on a location or time.

12

12. The method of claim 1 , wherein determining the rank for each activity is further based on a number of selections by a user for each activity.

13

13. A system, comprising: memory; one or more processors configured at least to: receive a time-related signal for a given activity, the given activity stored in a global activity database that comprises data defining a plurality of activities, wherein the given activity is associated with one or more global parameters, the global parameters comprising a timing-related priority, and wherein the time-related signal is related to at least one time-related parameter of the one or more global parameters, wherein the time-related signal for the given activity includes a signal for modifying the timing-related priority of the given activity, wherein the time-related signal includes a second signal for establishing a baseline for the timing-related priority of the given activity; determine a completion of the given activity based on the time-related signal; modify a time-period parameter of the given activity based on determining the completion of the given activity, wherein the time-period parameter comprises a period of time between periodically occurring activities; update the timing-related priority of the given activity based on the time-related signal; determine a subset of the plurality of activities as being related to the given activity based on one or more respective global parameters, the subset including the given activity; determine a rank for the one or more determined activities based at least in part on the timing-related priority, wherein determining the rank for each activity is further based on a number of selections by a user for each activity; select an activity list from the ranked subset of the plurality of activities based on the ranks of activities in the determined subset of the plurality of activities; generate an activity list display of the activity list using an activity assistant server; store a first time corresponding to the completion of the given activity; determine if a second time indicating a prior completion of the given activity exists; determine an elapsed period of time from the second time to the first time if the second time exists; and schedule a future time for the given activity based on the determined elapsed period of time from the second time to the first time.

14

14. The system of claim 13 , wherein the time-related signal includes a completion signal indicating that the given activity has been completed.

15

15. An article of manufacture including a tangible non-transitory computer-readable storage medium having computer-readable instructions stored thereon, which when executed by a machine, cause the machine to perform operations comprising: receiving a time-related signal for a given activity, the given activity stored in a global activity database that comprises data defining a plurality of activities, wherein the given activity is associated with one or more global parameters, the global parameters comprising a timing-related priority, wherein the time-related signal is related to at least one time-related parameter of the one or more global parameters, wherein the time-related signal includes a signal for modifying the timing-related priority of the given activity, wherein the time-related signal includes a second signal for establishing a baseline for the timing-related priority of the given activity; determining a completion of the given activity based on the time-related signal; modifying a time-period parameter of the given activity based on determining the completion of the given activity, wherein the time-period parameter comprises a period of time between periodically occurring activities; updating the timing-related priority of the given activity based on the time-related signal; determining a subset of the plurality of activities as being related to the given activity based on one or more respective global parameters, the subset including the given activity; determining a rank for the one or more determined activities based at least in part on the timing-related priority using an activity assistant server, wherein determining the rank for each activity is further based on a location or time; selecting an activity list from the ranked subset of the plurality of activities based on the ranks of activities in the determined subset of the plurality of activities; generating an activity list display of the activity list using the activity assistant server; storing a first time corresponding to the completion of the given activity; determining if a second time indicating a prior completion of the given activity exists; determining an elapsed period of time from the second time to the first time if the second time exists; and scheduling a future time for the given activity based on the determined elapsed period of time from the second time to the first time.

Patent Metadata

Filing Date

Unknown

Publication Date

December 3, 2013

Inventors

Stephen Chau
Andrew T. Szybalski
Stephane Lafon
Andrea Lynn Frome
Jerry Howard Morrison
Derek Prothro
Huy Nguyen

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “USING ACTIVITY STATUS TO ADJUST ACTIVITY RANKINGS” (8600981). https://patentable.app/patents/8600981

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.

USING ACTIVITY STATUS TO ADJUST ACTIVITY RANKINGS — Stephen Chau | Patentable