The present invention relates generally to the area of information processing and, more particularly, to apparatus and methods for reconciling ordinal information, especially time-based information.
Successful management of one's time is a goal that every successful professional must achieve. One's business day may be swept away in a deluge of meetings and appointments, all of which must be somehow managed. An attempt to mange this task on paper, such as with a simple wall calendar, is unworkable for all but the simplest of schedules. More likely, such unsophisticated aids to managing one's time will lead to scheduling conflicts, missed appointments, botched deadlines and angry clients.
The first allies that professionals discovered were portable organizers, such as the Daytime™ or the Lafax™. However, an increasing number are discovering the power of personal computers for managing appointments. Several scheduling packages are available for the PC. While not as portable as paper organizers, scheduling packages offer increased flexibility in other areas. For example, one may view his or her schedule from a variety of views—by month, week, day or priority—and attached detailed notes to appointments. Additional options available include the ability to automatically schedule a meeting for the first Monday of every other month, or display horizontal bars which graphically represent one's weekly schedule, so that free time can be quickly pinpointed. Other options include the ability to easily edit an entry, and set alarms as a reminder of important appointments.
With ever increasing emphasis on miniaturization and portability, several of the features of scheduling packages may now be found in handheld information processing devices, such as the Sharp Wizard™ or the Casio BOSS™. Being roughly the size of a handheld calculator, these electronic organizers are often carried when one is away from the office. As a tradeoff for portability, however, these devices typically forego several of the more desirable features found on desktop personal computer (e.g., full color graphics display). As a result, it is common for a professional to employ a personal computer to manage his or her time, yet carry a portable organizer when he or she is away from the office. Upon returning to the office, the information in the personal computer is then updated with the new information in the portable organizer.
Updating or reconciling two sets of information, whether between a PC and an organizer, or between two computers joined by a communication network, has never been easy. The reconciliation of scheduling information has been particularly difficult. Not only must one take into account when an event occurs, but one must also account for the duration of the event. While prior art organizers and scheduling packages are very useful for managing one's own schedule, they have thus far been inadequate for resolving two or more schedules. As a result, a user who wishes to reconcile two different schedules must rely on awkward data entry techniques to achieve the reconciliation.
What is needed is a system which allows a user of an information processing device to readily reconcile two or more schedules, or other time-based lists. The present invention fulfills this and other needs.
Computers have found a variety of applications for the management of one's time, including tracking meetings and appointments. With increased availability of portable information processing devices, many of the scheduling features found on personal computers are now available with handheld electronic organizers. Because handheld organizers sacrifice features for portability, professionals will often manage their time at the office with a personal computer, reserving the portable for when they are away. Upon returning to the office, however, one must reconcile the information stored in the portable with that already present in the personal computer.
According to the present invention, therefore, a method for reconciling two sets of information on an information processing system includes loading both sets of data, detecting the current date, building a new list for each set of data, synchronizing the lists (typically, according to time), and displaying the synchronized lists.
Upon display of the synchronized lists, the user may employ any of a variety of interface techniques for transferring information between the two synchronized lists. For example, the user may pick and choose from the two lists, as desired, including the deletion of undesirable entries. In addition, the information may be prioritized; for example, one list—the “master”—may always be given priority over another list. Alternatively, information may be prioritized according to level (e.g., “high,” “medium,” “low”) when it is entered (or any time thereafter). Upon completion of the reconciliation between the synchronized lists, the parent tables from which the information originated are respectively updated.
A system for processing multiple schedules, constructed in accordance with the principle of the present invention, includes an information processing system having a memory and a processor; an input device, such as a keyboard, for entering user information; a display device for showing scheduling information; an interface for sending and/or receiving information from another source; and means for reconciling two schedules by building synchronized lists, from which the user may effect a reconciliation.
FIGS. 3A-B illustrate two schedules, one from a laptop, the other from a desktop, which require reconciliation.
FIGS. 3D-G represent the user directed process (and screen feedback) for reconciling the two schedules of FIGS. 3A-B.
The present invention may be embodied on an information processing system such as the system 100 of
In operation, the user enters commands through the keyboard 104 and/or pointing device 105 which is typically a mouse, a track ball, or the like. The computer system displays text and/or graphic images and other data on the display device 106, such as a cathode-ray tube or an LCD display. A hard copy of the displayed information, or other information within the system 100, may be obtained from the printing device 108. In a preferred embodiment, the computer system 100 is an appropriately programmed IBM PC-compatible personal computer (available from a variety of vendors, including IBM of Armonk, N.Y.) running MS-DOS (available from Microsoft Corporation of Redmond, Wash.).
In this interactive computer system, the user enters scheduling and other time information with the keyboard 104 and/or pointing device 105. Alternative sources of information are available through the interface 109. Once entered, the information is stored in the memory 102 where it may be analyzed by processor 101. After appropriate formatting, the information is conveyed to the user by the display device 106 and/or printing device 108. The information may be saved for future use by storing it in the mass storage 107.
As shown in
Window 200 also includes a client area 220 for the display of time and scheduling information. Client area 220 may be partitioned into individual modules of information, such as the scheduling window 240 and the to-do list window of 250. Additional information may be viewed in the windows 240, 250 by activating scroll bars 245 and 255, respectively. Window 200 also includes a plurality of other work surfaces (e.g., such as a communication module) which are accessible by selecting an appropriate tab 260 with the keyboard or pointing device.
Within the window 240, a plurality of fields is available for the display of scheduling information. For example, field 242 is a text field for indicating the nature of the scheduling event. Field 241, on the other hand, lists the start time associated with the event. As shown, field 241 lists start time at a user-selected interval, e.g., thirty minutes; in addition, irregular start times (those not falling exactly on the defined intervals) are also accommodated. Additional screen indicia, such as screen icons, colors, or particular fonts, may be employed to convey additional information, such as the setting of an alarm for an event.
Reconciling Schedules User Interface
The following description will focus on the reconciliation of disparate scheduling information. The present invention is, however, not limited to such a specific application but, instead, may be applied advantageously to reconcile a variety of table or set-oriented information, particularly that which is temporal in nature. Thus, the following is offered for purposes of illustration and not limitation.
Referring now to FIGS. 3A-F, the reconciliation of information in accordance with the present invention is illustrated. With particular reference to FIGS. 3A-B, a first set of information 301 is to be reconciled with a second set of information 302. Information 301 will typically be accumulated independent (i.e., separate) from the information 302. For example, information 301 may represent scheduling information which has been entered on a portable device, such as a laptop computer 152 or a handheld organizer 154. Alternatively, each set of information may be accumulated and stored on a network 151, but at separate nodes (e.g., set 301 being a secretary's copy of a schedule, and set 302 being an executive's corresponding copy). Regardless of origin, the sets will share a common format (or be translatable into a common format) but, typically, will differ as to the exact information content shared between them.
As shown in
In addition to displaying textual messages and units of time, additional screen feedback 304 is provided. As shown, screen feedback 304 may include graphic symbols or textual messages to convey further information. For example, a musical note may be displayed t indicate that an alarm will sound when the event occurs. The letter “R” may be displayed proximate a time value to indicate that the event is a repeating event. In a similar manner, the duration of an event may be conveyed by illustrating a line from the start time of the event to its ending time (determined from the specified duration). As shown, events may overlap one another, whereby the duration lines are drawn in an overlapping fashion.
A corresponding set of information 302 is shown in
The actual reconciliation is accomplished as follows. The user requests reconciliation, for example, by selecting the “reconcile” option from the submenu 230 (of
This “synchronizing” process allows the user to better visualize the reconciliation, thus improving his or her ability to resolve any conflicts (n those cases where automatic conflict resolution, such as based on priority, has not been enabled). Employing a user interface element, such as an insertion arrow 330, the user may readily transfer events from one list to another by selectively specifying the desired event and the direction of insertion. The user may also globally insert one list into another, as desired.
In addition to reconciling scheduling information, the user may reconcile a list of priorities, such as a “to do” list. While not shown, each to do even my include a due date, a priority level, as well as any other desired information. In a manner similar to that for reconciling scheduling information, the to do lists of client areas 341, 342 may be reconciled, for example by synchronizing corresponding due dates.
Referring to FIGS. 3D-G, a “point-and-shoot” technique for reconciling the schedules 301, 302 is illustrated.
Various masks may be applied by the system 100 at this point to block the reconciliation between selected fields. For example, the recipient table (e.g., that of an executive) may mask a lunch period so that an updating table (e.g., from a secretary) cannot assert entries into those blocked fields. In a similar manner, a priority event in one table may mask those time slots covered by its duration so that events from another table may not be inserted thereat.
As shown in
The completed operation of the previously described reconciliation step is shown in
The completion of this step is shown in
Reconciliation of Schedules: Internal Operations
Referring now to FIGS. 4A-B, a method according to the present invention for reconciling two or more sets of information is illustrated. The steps for the reconcile method 400 are as follows. In step 401, the two tables or sets of information to be reconciled (T1 and T2) are loaded into the system (e.g., from mass storage 107, organizer 154, network 151, or the like). The formatting and storing of information into sets or database tables is known in the art; see e.g., Date, C. J., An Introduction to Database Systems, volumes I and II, Addison Wesley, 1983; the disclosure of which is hereby incorporated by reference. At this point, the system may (optionally) verify user access, for example, by checking passwords.
At step 403, the “current” date is retrieved. The current date is not necessarily the same as the system date, which is automatically tracked by the system 100. Instead, the current date is the date of interest to the user. In particular, the user may toggle through various days, both past and present. As an example,
The step of synchronizing the tables, step 405, is illustrated in further detail by
After completion of step 454, the method returns to step 406 to display the synchronized lists. Next, in step 407, the system enters an event loop to process user events, such as keyboard or mouse events. During this loop, the user may execute any of the previously described reconciliation activities (e.g., insertion, deletion, editing, and the like). User events are repeatedly interpreted until the user indicates that he or she is finished (at step 408). Upon completion of the reconciliation, the parent tables T1 and T2 are updated from T1′ and T2′, respectively.
Recoloring Screen Objects
Referring now to
Referring now to
While the invention is described in some detail with specific reference to a single preferred embodiment and certain alternatives, there is no intent to limit the invention to that particular embodiment or those specific alternatives. The true scope of the invention is defined not by the foregoing description but by the following claims.
This application claims priority to application Ser. No. 09/060,206 filed on Apr. 14, 1998 and scheduled to issue as U.S. Pat. No. 7,209,888 on Apr. 24, 2007; which is a continuation of application Ser. No. 08/649,824 filed on May 17, 1996 now U.S. Pat. No. 5,778,346; which is a continuation of application Ser. No. 07/823,567 filed on Jan. 21, 1992 now U.S. Pat. No. 5,519,606.
Number | Date | Country | |
---|---|---|---|
Parent | 09060206 | Apr 1998 | US |
Child | 11739019 | Apr 2007 | US |
Parent | 08649824 | May 1996 | US |
Child | 09060206 | Apr 1998 | US |
Parent | 07823567 | Jan 1992 | US |
Child | 08649824 | May 1996 | US |