Machine-implemented activity management system using asynchronously shared activity data objects and journal data items

• US 9,002,900 B2
• Filed: 11/23/2009
• Issued: 04/07/2015
• Est. Priority Date: 02/18/2004
• Status: Active Grant

• Current Assignee: Callahan Cellular LLC (Intellectual Ventures LLC)
• Original Assignee: Tarabunk Fund LLC (Intellectual Ventures LLC)
• Inventors: Feinsmith, Jason B.
• Primary Examiner(s): LU, KUEN S
• Application Number:
  US12/624,307
• Publication Number:
  US 20100070542A1
• Time in Patent Office: 1,961 Days
• Field of Search: 707/802
• US Class Current: 707/802
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: Y10S 707/99939 Privileged access
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

Machine-assisted methods and apparatus are disclosed for allowing individual users to develop and organize respective activity descriptions and supporting journal items according to their respective preferences. Cross-referencing mappings may be created between activity descriptions and journal items in order to find, filter and organize disparate data. Cross-referencing mappings may also be created between the developed activity descriptions of different users so they can better understand each others perspectives and possibly overlapping goals. Different users'"'"' activity descriptions can be presented to a user even while the user may be disconnected from communication networks. Hierarchical relationships between activity descriptions may be provided. Machine-assisted means may be provided for creating work-sharing, work-delegating and/or informational sharing agreements between different users. Further machine-implemented means may be provided for automatically and asynchronously updating users on shared activities by other users even though all users are not necessarily connected to one or more respective communication networks at same time.

Claims

1. A method comprising:

storing, in a first area of a memory of a first computer system, a hierarchical data structure including a plurality of activity data items each representing an activity and each having a description and a status, wherein;

each activity data item other than a root activity data item is a child of a parent activity data item and represents a subtask of the task represented by the parent activity data item; and

the status for each node is recorded in a data field associated with that node;

storing, in a second area of the memory of the first computer system, an unstructured set of activity data items each having a description;

receiving a user input instructing a processor of the first computer system to associate an activity data item from the unstructured set of activity data items with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure;

receiving from a second computer system an additional activity data item; and

storing the received additional activity data item in the second area.

2. The method of claim 1, further comprising receiving an input instructing the processor to associate the received additional activity data item with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure.

3. The method of claim 2, further comprising transmitting, from the first computer system to the second computer system, information regarding at least one of the parent and child activity data items of the received additional activity data item following association of the received additional activity data item with the hierarchical data structure.

4. The method of claim 2, further comprising:

receiving a second input to the first computer system instructing the processor to perform a modification on the received additional activity data item; and

transmitting the modification from the first computer system to the second computer system.

5. The method of claim 2, further comprising:

receiving a second input on the first computer system instructing the processor to perform a modification on one of a child activity data item and a parent activity data item of the received additional activity data item; and

transmitting the modification from the first computer system to the second computer system.

6. The method of claim 2, wherein receiving the input instructing the processor to associate the received additional activity data item with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure comprises associating the received additional activity data item with the hierarchical data structure as a child of a first parent activity data item;

the method further comprising associating the received additional activity data item to the hierarchical data structure as a child of a second parent activity data item.

7. The method of claim 1, wherein receiving from the second computer system the additional activity data item comprises receiving the additional activity data item by way of a central server operable to translate at least one field of the received additional activity data item from a field that is not defined on the first computer system to a field that is defined on the first computer system.

8. The method of claim 1, wherein receiving the input instructing the processor of the first computer system to associate the additional activity data item from the unstructured set of activity data items with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure comprises:

receiving the user input in a graphical user interface dragging and dropping a graphical representation of the activity data item from a graphical representation of the unstructured set of activity data items onto a graphical representation of the hierarchical data structure.

9. The method of claim 1, wherein at least a portion of the plurality of activity data items of the hierarchical data structure include a start date;

and wherein the method further comprises refraining from displaying an activity data item having a start date prior to the start date thereof.

10. A non-transitory computer readable medium having instructions stored thereon that, if executed by a computing system, cause the computing system to perform operations comprising:

storing, in a first area of a memory of a first computer system, a hierarchical data structure including a plurality of activity data items each representing an activity and each having a description and a status, wherein;

each activity data item other than a root activity data item is a child of a parent activity data item and represents a subtask of the task represented by the parent activity data item; and

the status for each node is recorded in a data field associated with that node;

storing, in a second area of the memory of the first computer system, an unstructured set of activity data items each having a description;

receiving a user input instructing a processor of the first computer system to associate an activity data item from the unstructured set of activity data items with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure;

receiving from a second computer system an additional activity data item; and

storing the received additional activity description in the second area.

11. The computer readable medium of claim 10, wherein the instructions are further operable to cause the computing system to perform operations comprising:

receiving an input instructing the processor to associate the received additional activity data item with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure.

12. The computer readable medium of claim 11, wherein the instructions are further operable to cause the computing system to perform operations comprising:

transmitting, from the first computer system to the second computer system, information regarding at least one of the parent and child activity data items of the received additional activity data item following association of the received additional activity data item with the hierarchical data structure.

13. The computer readable medium of claim 11, wherein the instructions are further operable to cause the computing system to perform operations comprising:

receiving a second input on the first computer system instructing the processor to perform a modification on the received additional activity data item; and

transmitting the modification from the first computer system to the second computer system.

14. The computer readable medium of claim 11, wherein the instructions are further operable to cause the computing system to perform operations comprising:

receiving a second input on the first computer system instructing the processor to perform a modification on one of a child activity data item and a parent activity data item of the received additional activity data item; and

transmitting the modification from the first computer system to the second computer system.

15. The computer readable medium of claim 10, wherein receiving the user input instructing the processor of the first computer system to associate the activity data item from the unstructured set of activity data items with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure comprises:

receiving the user input in a graphical user interface dragging and dropping a graphical representation of the activity data item from a graphical representation of the unstructured set of activity data items onto a graphical representation of the hierarchical data structure.

16. A computing device, comprising a processor and a memory, the memory storing instructions operable to cause the computing device to perform operations comprising:

storing, in a first area of a memory of a first computer system, a hierarchical data structure including a plurality of activity data items each representing an activity and each having a description and a status, wherein;

each activity data item other than a root activity data item being a child of a parent activity data item and representing a subtask of the task represented by the parent activity data item; and

at least one of the activity data items is a leaf node in the hierarchical data structure;

storing, in a second area of the memory of the first computer system, an unstructured set of activity data items each having a description;

receiving a user input instructing a processor of the first computer system to associate an activity data item from the unstructured set of activity data items with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure;

receiving from a second computer system an additional activity data item; and

storing the received additional activity description in the second area.

17. The computing device of claim 16, wherein the instructions are further operable to cause the computing device to perform operations comprising:

receiving an input instructing the processor to associate the received additional activity data item with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure.

18. The computing device of claim 16, wherein receiving the user input instructing the processor of the first computer system to associate the activity data item from the unstructured set of activity data items with the hierarchical data structure as a child or parent of one of the activity data items of the hierarchical data structure comprises:

receiving the user input in a graphical user interface dragging and dropping a graphical representation of the activity data item from a graphical representation of the unstructured set of activity data items onto a graphical representation of the hierarchical data structure.