CA1313413C - Method of exchanging entries from a plurality of different electronic calendars in a communication system - Google Patents
Method of exchanging entries from a plurality of different electronic calendars in a communication systemInfo
- Publication number
- CA1313413C CA1313413C CA000601599A CA601599A CA1313413C CA 1313413 C CA1313413 C CA 1313413C CA 000601599 A CA000601599 A CA 000601599A CA 601599 A CA601599 A CA 601599A CA 1313413 C CA1313413 C CA 1313413C
- Authority
- CA
- Canada
- Prior art keywords
- calendar
- meeting
- event
- reply
- status
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/109—Time management, e.g. calendars, reminders, meetings or time accounting
Abstract
Abstract METHOD OF EXCHANGING ENTRIES
FROM A PLURALITY OF DIFFERENT ELECTRONIC
CALENDARS IN A COMMUNICATION SYSTEM
A method of exchanging entries on calendars being maintained by a first and a second calendar users. An event is automatically scheduled on a second calendar if a classification which is associated with the event is higher than any previous scheduled event for the same time slot. A reply is prepared and transmitted to the first calendar user which requested the sched-uling of the event regarding the status of the second user in regards to the scheduled event. Subsequently, if the status of the second user changes in regards to the event, a subsequent reply is prepared and trans-mitted to the first user setting forth the changed status.
FROM A PLURALITY OF DIFFERENT ELECTRONIC
CALENDARS IN A COMMUNICATION SYSTEM
A method of exchanging entries on calendars being maintained by a first and a second calendar users. An event is automatically scheduled on a second calendar if a classification which is associated with the event is higher than any previous scheduled event for the same time slot. A reply is prepared and transmitted to the first calendar user which requested the sched-uling of the event regarding the status of the second user in regards to the scheduled event. Subsequently, if the status of the second user changes in regards to the event, a subsequent reply is prepared and trans-mitted to the first user setting forth the changed status.
Description
~L3~3~
DESCRIPTION
MET~OD OF EXCHANGING ENTRIES
FROM A PLURALITY OF DIFFERENT ELECTRONIC
Field of Invention:
This invention relates in general to electronic calendaring methods, and in particular, to methods of exchanging calendar entries from different calendars.
Background Information:
The prior art has disclosed a number and variety of interactive electronic calendaring systems and methods. The objective of all of these systems is primarily to assist the person who, for a number of - different reasons, maintains a calendar of future events containing various information about the event at entry points on the calendar which relate to the time of the event.
The increase of personal computers and intelli-gent workstations in recent years has made it possible for calendar owners to ~stablish and maintain their calendars on these interactive type data processing systems. Hence, the term "electronic calendaring."
Two general types of interactive electronic calendaring systems have thus evolved in the art. In one type of calendaring system, the owner of the calendar is generally also the user of the workstation and that workstation is generally not a part of a ;larger network. Generally, in these types of sys-tems, the calendar functions involve presenting a screen to the user representing a day calendar divided into a number of time periods or time slots. Each period is capable of displaying a limited amount of ~3~3~ 3 te~t that the user enters. In some systems, the day calendar can scroll vertically to presen1 more time periods to the user or horizontally to present longer text entries~ The operator can generally l'page"
forward or backward and, in most arrangements, can display a requested date. These calendaring methods generally do not limit the type of event that is calendared nor the terminology employed at any of the entry points and, to that extent, function in the same manner as conventional manual calendars or appointment books. The electronic calendaring method and systems do have an advantage over the prior art manual calendaring of events in that the user generally has the ability to scan a time span involving a large number of days and identify calendared events quite rapidly.
The other type of calendaring arrangement that has developed in the prior art involves multi-user environments having a large number of terminals or workstations which are generally part of a larger communication network. Usually these networks have 'been established to permit the users to interact with each other and with data maintained on the system. In ; this environment, a user at a terminal or workstation can send a message to one or more of the other users on the network concurrently, and is noti~ied when the addressees have received and read the message. In most of these environments, each user generally maintains a calendar, and in many of these environ-ments the reason for having a network in which usersinteract, quite often involves user interaction that requires reference to the respective electronic calendars of the users. A considerable amount of time is therefore spent by calendar users in many organiza-tions, with people checking and rearranging their ~3~1 3~
calendars to accommodate various events such as meetings and presentations. Calendar systems have progressed to the point where a person who is calling a meeting can at least view the calendars of a number of users that he intends to invite to a meeting, in order to determine a common available time for the meeting O
In this prior art system, a screen is presented to the meeting originator which requests the data necessary for the system to determine times that all potential attendees would be available. The data requested includes, for example, the length of the mee-ting, a time period during which the meeting should be conducted, the place of the meeting and the names of the attendees. Based on this data, the method returns a screen of available times after inspecting each attendee's day calendar during the time period for free time slots or periods.
The originator then selects the beginning time and end time of the meeting, including the time and date, and invitations are automatically sent to all the attendees, requesting their attendance at the scheduled meeting.
While such an automatic system saves time in finding a convenient meeting time, relative to the manual process, the process is limited to the schedul-ing of meetings based on "free time" as represented by the absence of a calendar entry on each of the in-spected calendars. This approach does not recognize 3Q that some calendar entries are less important than others and, in practice, it is often impossible to find a common period of "free time" for a meeting that involves a large group of people or a meeting involv-ing a number of people whose work requires a large number of meetings.
AT9-a6-047 ~3~3~
The prior art systems are limited to e~amining calendars of others in connection with setting up a meeting. It was soon recognized that there were other situations besides calling a meeting where it would be beneficial to be able to create a "selected viewl' of a number of individual calendars.
A department manager, for example, may have an assignment that can be given to a number of different people in his department. If the calendaring system could display to the manager the calendared events of each of these people which meet a set of search criteria entered into this system interactively by the manager, considerable time and effort could be saved by everyone involved. While time available or free time may be one of the search criteria entered, other criteria such as the relative importance of the events that are calendared to the new assignment, might also provide the manager with more relevant data than just free time. Also, identifying the person who handled the same or similar assignment in the past, similar assignments scheduled in the future or other assign-ments scheduled at the same geographic location or customer could be important criteria for the manager to employ. These deficiencies of the prior art electronic calendaring methods, namely using only free time to find relevant calendar entries, are overcome by the present invention.
Disclosure of the Invention This invention relates to methods of exchanging entries in a plurality of calendars being maintained on an information processing system. The invention enables an end user (invitor) who maintains a calendar on the information processing system to schedule a meeting and invite other end users (invitees) who ~3~3~3 maintain respective calendars on the system to the meeting. The invitor sends each of the invitees a meeting notice or request. The current status of each of the respective invitees is determined in response to receipt of the meeting notice and an entry for the scheduled meeting is automatically entered on the calendar of each invitee based upon the classifi-cation of the invitee as set forth in the meeting notice. A log is maintained o~ each entry or attempt-ed ent~y and its associated status for the invitor andeach of the respective invitees. A reply, which sets forth the invitee's status in regard to the schedule meeting, is prepared and transmitted to the invitor.
Subse~uently, if a seLected invitee's status changes in regard to the scheduled meeting, the invitee's calendar is automatically updated and the invitor is automatically informed of this status change.
DESCRIPTION _F THB DRAWINGS:
Fig. 1 illustrates an interactive workstation in which the method of the present invention may be advantageously employed.
Fig. 2 illustrates an information processing system having a plurality of networks which include the interactive workstations of Fig. 1~
Fig. 3 through 9 flow charts, illustrating the detailed steps of the method of the present invention.
Best Mode for Carrying Out ~he Invention:
Fig. 1 illustrates the functional components of an interactive type data processing workstation or terminal 10 on which the electronic calendaring method of the present invention may be advantageously em-ployed~ The terminal 10 compxises a processing unit 11 which includes a microprocessor block 12, a ~3~L3~ 3 semiconductor memory 13, and a control block 14 which functions to control input/output operations in addition to the interaction between the micro-processor block 12 and the memory unit 13.
The terminal 10 further includes a group of conventional peripheral units including a display device 16, a keyboard 17, a printer 13, a disk storage unit 19, and a modem 20. Since the details of the above-dQscribeâ functional blocks form no part of the present invention and can be found in the prior art, only a brief functional description of each block is set forth, along with-a description of their interac-tions, sufficient to provide a person of ordinary skill in the art with a basis of understanding appli-cants' improved electronic calendaring method.
Processing unit 11 corresponds to the "systemunit" of a personal computer system such as the IBM XT
or IBM AT type systems. Unit 11 is provided with an operating system program which may be one of the many versions of DOS (Disk Operating System) which is normally employed to run the systems. The operating system program is stored in memory 13 along with one or more application programs that the user has select-ed to run. Depending on the capacity of memory 13 and the size of the application programs, portions of these programs, as needed, may be transferred to - memory 13 from the disk storage unit 19 which may include, for example, a 30 megabyte hard disk drive and a diskette drive. The basic function of the dlsk storage unit is to store programs and data that are employed by the system and which may readily be transferred to the memory unit 13 when needed. The function of the diskette drive is to provide a remov-able storage function for entering programs and data into the system, and a vehicle for storing data in a ~3~ 3 form that is readily transportable for use on other terminals or systems.
Display device 16 and keyboard 17 together provide for the lnteractive nature of the terminal 10, in that in normal operation, the interpretation that the system gives to a specific keystroke by the operator depends, in substantially all situations, on what is being displayed to the operator at that point in time.
In some situations, the operator, by entering commands into the system, causes the system to perform a certain ~unction. In other situations, the system requests the entry of certain data, generally by displaying a prompt type of menu/message screen. The depth of the interaction between the operator and the system varies by the type of operating system and the application program, but is a necessary characteristic of terminals on which the method of the present invention may be employed.
The terminal 10 shown in Fig. 1 further includes a pxinter 18, which functions to provide hard copy output of data developed or stored in the terminal 10.
Lastly, the modem 20 functions to transfer data from the terminal of Fig. 1 to a host system through one or more communication links which may be a commercial type link or a dedicated communication link.
Fig. 2 illustrates an information processing system 21 having a first network 22 and a second network 23. Each of the networks 22 and 23 includes a plurality of nodes 25 incorporated therein. The networks 22 and 23 also include host central process-ing unit 27 and 29, respectively. ~s illustrated, a plurality of interactive terminals 10 of the type shown in Fig. 1 are interconnected with each other within each of the networks 22 and 23 through the AT9~86-0~7 .
~313~
respective host processing units 27 and 29, respec-tively. The networks 22 and 23 are coupled together via a communication link 33. Functionally, each of the networks 22 and 23 operates to allow one terminal to communicate with one or more terminals within the information processing system 21 using established communication protocols, so that the various serially connected communication links are transparent to an end-user. Such communiCatiQn systems are well known in the art and are currently in extensive commercial use. Since these communication links per se are not a part of the present invention, only those details that are necessary for an understanding of the method of calendaring an event in the present invention will be described. It should therefore be assumed in the following description, that each interactive terminal 10 in the information processing system 21 has a system node address and a terminal address and that to simplify the description, there is only one individual ~; 20 assigned to each of the terminals within the informa-tion processing system. It should further be assumed that conventional communication services are provided by the networks 22 and 23, such as directory listings of individual calendar owners and shareable resources such as meeting rooms, etc.l which require scheduling.
The information processing system 21 shown in Fig. 2 processes information as various types of data objects such as text data objects, graphic data objects, and calendar data objec~s. Each of thesP
3G data objects are represented by a datastream which comprises a series of structured fields.
The present invention provides communication logic which is necessary to schedule meetings, to respond to meeting invitations and to reschedule or cancel meetings in an automatic manner. For purposes ~3~3~ 6 3 of illustration, at least two end user must maintain calendars on either or the same one of the networks 22 and 23. Moreover, the calendars being maintained on the networks 22 and 23 are available to the communica-tion logic so that access is invisible to the endusers or calendar owners. Thus, each of ~he end users are allowed to schedule calendar events on the other's calendar.
A typical application of the present invention is to invite selected individuals to a meeting which has been scheduled. An end user or caller of the sched-uled meeting sets up a distribution list of invitees and the roles associated with attendance status.
These roles include key a-ttendee, invitee, call-er/arranger of the meetiny, alternate, additionalattendee, receives copy, blind copy, blind copy~invitee. A link is established to invite the selected individuals on the distribution list to the meeting and to accept the individual responses of the meeting invitation. The individual responses, such as "would be attending", "not attending", "sending alternate", I'tentative for the meeting" and "user acknowledge", are stored as part of the status of the scheduled meeting.
In the preferred embodiment of the present invention, there are three types of invitees to any regularly scheduled meeting: normal, regular and key.
A normal invitee is an individual who is invited to this regularly scheduled meeting for the first and possibly the only time. A regular invitee is an individual who is invited to this regularly scheduled meeting as is normally done for this date and time. A
key invitee is an individual who is invited to this regularly scheduled meeting as is normally done or for the first and only time. The meeting will be ~ 3~3~
cancelled or rescheduled if the key invitee can not attend.
In response to the receipt of the invitation to the regularly scheduled meeting, the status or re-sponse of a recipient of the invitation is indicatedas:
Recorded - The meeting invitation was received and the recipient either acknowledges this or simply records the meeting notice on the recipient's calendar.
- ~entative Accept: The recipient has agreed to tentatively attend the meeting.
. - Accepted (Automatic): The recipient has agreed to attend the meeting via some preset response mechanism.
- Accepted (Explicit or Choice~: The recipient has agreed to attend the meeting via a manually generated response.
- Tentative Reject (Conflict): Recipient has tentatively rejected attending the meeting because of a conflict which may or may not be resolved.
- Rejected (Conflict): Recipient has automatically rejected attending the meeting because of a conflict which can not be resolved.
- Rejected (Explicit): Recipient has manually rejected attending the meeting because of a ~ ~1 3~:~3 conflict which can not be resolved.
Shown in Tables 1 and 2 are state diagrams of various scenarios showing the status of an invitee in response to the meeting notice.
Table 1 Multiple Active Entries No No Yes New Entry Key or Regular Yes No New Entry Normal No Yes _ Tentative Accept Procedure X
Automatic Accept Procedure X
Go to Table 2 X
Table 2 Current Accept (Choice) Yes No No No No No No No Current Accept (Auto1 - Yes Yes Yes No No No No Current Tentative Accept - - - - Yes Yes No No New Entry Key - Yes Yes No - - - -Current Regular - No Yes - - - -New Entry Normal - - - ~ No Yes Yes No Tent. Reject Proc. (old) X X
Tent. Reject ProcO (new) X X X X
Auto Accept Proc. (new) X X X
Tent. Accept (new) X
As noted above, all invitees to a regularly scheduled meeting or recipients of a meeting notice are classified as a key, a regular or a normal invitee. A meeting will be automatically scheduled on an lnvitee's/recipient's calendar within the ~ 3 ~ 3 information processing system 21 (Fig. 1) if the invitee's/recipient's classification in the scheduled meeting is higher than that of a previously scheduled meeting on the recipient's calendar for the same date and time. Referring to the state diagram shown in Table 1, the first column sets forth a scenario whereby the recipient does not have anv multiple active or previous entries for the date and time set forth in a new meeting invitation and the new invita-tion classifies the recipient as a key or a regularinvitee. An automatic acceptance procedure is then transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
lS The second column of Table 1 sets forth the scenario whereby the recipient does not have any multiple active entries and the new invitation classi-fies the recipient as a normal invitee. A tentative acceptance procedure is transmitted to the call-er/arranger of the new meeting and the new meeting is tencatively scheduled on the recipient's calendar.
If the recipient's calendar includes multiple active entries for the time and date specified in the new meeting notice, Table 2 sets forth a state diagram which illustrates various scenarios and the recipi-ent's response to the new meeting. In the first column of Table 2, the recipient has explicitly chosen to attend a particular meeting for the time and date specified in the meeting notice. In view of this explicit choice, all new invitations to meetings, irrespective of the classification, will be tentative-ly rejected. Thus, the tentative rejection procedure is transmitted to the caller/arranger of the new meeting.
AT9-86-0~7 ~3~3~
Column two of Table 2 sets forth a scenario whereby the recipient currently has an automatic acceptance to a meeting which classifies the recipient as a key or a regular invitee and the new meeting :~ 5 notlce classifies the recipient as a key invitee.
Column two also sets forth that the current acceptance is not classified as a regular invitee. Since the classification of the current acceptance is the same as the classification set forth in the new meeting notice, the tentative reject procedure is transmitted to the caller/arranger of the new meeti.ng.
Column three of Table 2 sets forth a scenario whereby the recipient currently has an automatic acceptance with the recipient classified as a regular invitee and a new invitation which classifies the recipient as a key invitee. A tentative reject procedure is transmitted to the caller/arranger of the current meeting, an automatic acceptance procedure is transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
Column four sets forth a scenario whereby the reci~ient currently has an automatic acceptance which classifies the recipient as a key or a regular invitee and the new invitation classifies the recipient as a regular or a normal invitee. The tentative reject ~ procedure is transmitted to the caller/arranger of the : new meeting because the classification of the new meeting does not exceed that of the classification of the current acceptance.
Column five sets forth a scenario whereby the ; recipient currently has a tentative acceptance which ~ classifies the recipient as a normal invitee and the -~ new invitation classifies the recipient as a key or a regular invitee. The tentative reject procedure is ~31~3 ~4 transmitted to the callerfarranger of the current meeting, the automatic accept procedure is transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
Column six sets forth a scenario whereby the recipient has a current tentative acceptance with the recipient classified as a normal invitee and the new invitation also classifies the recipient as a normal invitee. The tentative reject procedure is transmit-ted to the caller/arranger of the new meeting.
Columns seven and eight set forth scenarios whereby the recipient of the new meeting notice currently does not have an automatic acceptance or a tentakive acceptance. In column seven, the new invitation classifies the recipient as a normal invitee. The tentative accept procedure is then transmitted to the caller/arranger of the new meeting ; and the new meeting is tentatively scheduled on the recipient's calendar. In column eight, the new invitation classifies the recipient as a key or a regular invitee. 'rhe automatic acceptance procedure is transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
Set out below is an illustration of a calendar program for generating the exchanging entries in a plurality of calendars being maintained in the infor-mation processing system 21. The calendar program is in program design language from which source code and machine code are derivable. In the present invention, it is to be assumed that system 21 is under mouse and keyboard device control. Moreover, it is to be assumed that the calendar program is invoked from a user application which facilitates a user in the system 21 to access at least two calendars being ~3~3~
maintained in the system. Additionally, the calendar program is able to activate an electronic mail system, such as the PROFS system which is commercially avail-able from the Inter~atlonal Business Machines Corpora-tion. Since the user application and the electronic application is not essential to the present invention, they will not be described in detail.
BEGIN CALENDAR MAIN PROC
The user application invokes o~e of a plurality of calendar functions such as schedule a meeting, irlvite user to a meeting, accept a meeting invitation, reject a meeting invitation, change rneeting attendance status, etc. The invoked calendar func~ion will update the user's local calendar to establish a meeting and then return control to the user application.
; IF THE MAIL SERVICE NEEDS TO BE INVOKED FOR ANY
ITEM SUCH AS INVITING PEOPLE TO A MEETING
THEN INVOKE SENDING MAIL SERVICE
ENDIF
DO IN RESPONSE TO A CALENDAR REQVEST BEING
RECEIVED, THE INFORMATION PROCESSING SYSTEM
DETERMINES FOR EACH INVITEE WHETHER THE
CALENDAR SERVICE IS TO BE INVOKED
ENDDO
IF A REQUEST TO SCHEDULE REGULAR MEETINGS, INVITE
USERS/INVITEES TO A MTG, EXECUTE A FREE TIME
SEARCH, ACCEPT A MTG INVITATION, REJECT A MTG
INVITATION, SEND AN ALTERNATE TO A MEETING, CHANGE MTG ATTENDANCE STATUS, OR CANCEL A MTG
IS RECEIVED
THEN PASS CONTROL TO THE APPROPRIATE ROUTINE
TO ACCOMPLISH THE TASK
~3~3~
ELSE ANOTHER TYPE OF MAIL REQUEST IS
PROCESSED.
ENDIF
(Control is returned to this point after calling the appropriate subroutine) IF THE RETURN CODE FROM THE CALENDAR PROCESS
IS ENQUEUE THE REQUEST
THEN ENQUEUE THE REQUEST AND TEST FOR
THE END OF THE TASK
ELSE
IF THE RETURN CODE INDICATES TASK
COMPLETE (DONE]
THEN TEST FOR END OF TASK
ELSE BUILD A STATUS RECORD TO
INDICATE SOME OTHER TYPE OF
STATUS
TRANSMIT THE STATUS TO
CALLER/ARRANGER
ENDIF
ENDIF
IF ALL INVITEES/RECIPIENTS HAVE BEEN PROCESSED
THEN RETURW CONTROL TO THE SYSTEM
ELSE POINT TO THE NEXT INVITEE/RECIPIENT AND
RETURN CONTROL TO THE SYSTEM TO DETERMINE
THE PROCESS TO BE INVOKED FOR THE NEXT
INVITEE/RECIPIENT
ENDIF
END CALENDAR MAIN PROC
BEGIN MEETING SUBROUTINE
ADD THE NEW ENTRY TO THE INVITEE'S CALENDAR
: IF THERE ARE NO MULTIPLE ACTIVE ENTRIES THEN
IF THE NEW PRIMARY STATUS = NORMAL MTG
.. , .... . ~.. . .... . ~i, ~ 3 ~
TEIEN SET CURRENT PRIMARY STATUS =
NORMAL TENTATIVE ACCEPT AND
PREPARE A TENTATIVE ACCEPT REPLY
ELSE SET CURRENT PRIMARY STATUS = TO
TXE CURRENT STATUS (KEY OR REGULAR~
SET NEW ENTRY AND CURRENT SECONDARY
STATUS = ACCEPT (AUTO~ AND PREPARE AN
ACCEPT (AUTO~ REPLY
ENDIF
ELSE
IF THE CURRENT SECONDARY STATUS = ACCEPT BY
CHOICE
THEN SET THE NEW SECONDARY STATUS =
TENTATIVE REJECT AND PREPARE A
TENTATIVE REJECT REPLY
ELSE
IF THE CURRENT SECONDARY STATUS = ACCEPT
(AUTO) THEN
IF PRIMARY STATUS = KEY
THEN
IF CURRENT PRIMARY STATUS =
REGULAR
THEN SET CURRENT PRIMARY STATUS
= THE NEW PRIMARY STATUS, SET
CURRENT & NEW ENTRY SECONDARY
STATUS = ACCEPT (AUTO, SET
PREVIOUS CURRENT SECONDARY
STATUS = TENTATIVE REJECT, SEND TENTATIVE REJECT REPLY
TO PREVIOUS INVITOR AND
` PREPARE ACCEPT (AUTO) REPLY
j ELSE SET THE NEW SECONDARY STATUS
;~ = TENTATIVE REJECT AND
PRh'PARE A TENTATIVE REJECT
REPLY
,~
., , ~3~1 3~3 ENDIF
ELSE SET THE NEW SECONDARY STATUS =
TENTATIVE REJECT AND PREPARE A
- TENTATIVE REJECT REPLY
ENDIF
ELSE
IF THE CURRENT SECONDARY STATUS =
TENTATIVE ACCEPT THEN
IF NEW PRIMARY STATUS -NORMAL THEN SET THE NEW
SECONDARY STATUS =
TENTATIVE REJECT AND
PREPARE A TENTATIVE REPLY
ELSE SET CURRENT PRIMARY
STATUS = THE NEW PRIMARY
STATUS, SET CURRENT ~ NEW
. ENTRY SECONDARY STATUS =
; ACCEPT (AUTO), SET PREVIOUS
CURRENT SECONDARY STATUS =
TENTATIVE REJECT, SEND
TENTATIVE REJECT REPLY TO
PREVIOUS INVITOR AND
PREPARE ACCEPT (AUTO~ REPLY
ENDIF
ELSE
IF NEW PRIMARY STATUS -NORMAL THEN SET THE NEW
SECONDARY STATUS =
TENTATIVE ACCEPT AND
PREPARE A TENTATIVE ACCEPT
: REPLY
ELSE SET NEW SECONDARY STATUS
= ACCEPT (AUTO) AND PREPARE
ACCEPT (AUTO) REPLY
ENDIF
~3~3~3 ENDIF
ENDIF
ENDIF
ENDIF
SEND PREPARED REPLY TO INVITOR/CALLE:R, MAIL
CALENDAR ALERT TO INVITEE
SET THE CURRENT POINTER TO TEIE NEW ENTRY, SET
RETURN CODE 3 DONE AND ~ETURN TO THE CALLING
(CALENDAR) ROUTINE
END MEETING SUBROUTINE
BEGIN CANCEL SUBROUTINE
LOCATE THE MEETING ON THE INVITEES' CALENDAR
IF THE MEETING IS NOT FOUND
THEN ENTER A CANCELLED MEETING NOTICE ONTO
THE INVITEE'S CALENDAR
: ELSE MARX T~E SUBJECT MEETING CANCELLED ON THE
INVITEE'S CALENDAR, SEND A CALENDAR ALERT TO THE INVITEE, SET THE RETUXN CODE = DONE FOR ANALYSIS AND
RESPONSE ON RETURN AND RETURN CONTROL TO THE
CALLING (CALENDAR) ROUTINE
ENDIF
END CANCEL SUBROUTINE
BEGIN REPLY SUBROUTINE
LOCATE THE MEETING ON THE INVITEES' CALENDAR
IF THE MEETING IS NOT FOUND
THEN SET THE RETURN CODE TO ENQUEUE AND
RETURN TO THE CALLING (CALENDAR~ ROUTIWE
ELSE UPDATE THE REPLIER'S MEETING ATTENDANCE
STATUS PER THE REPLY, SEND A CALENDAR ALERT TO THE INVITEE
SET THE RETURN CODE = DONE FOR ANALYSIS AND
RESPONSE ON RETURN AND RETURN CONTROL TO THE
~3~3~3 CALLING (CALENDAR) ROUTINE
- ENDIF
END REPLY SUBROUTINE
5 . BEGIN FREE TIME SEARCH SUBROUTINE
DETERMINE THE TIME SPAN FOR THE FREE TIME SEARCH
DETERMINE THE LENGTH OF FREE TIME NEEDED (TIME
INCREMENT) CHECK THE CURRENT TIME INCREMENT IN THE TIME SPAN
FOR OPEN TIME
IF THE INCREMENT IS OPEN (FREE) THEN MARK THE TIME OPEN IN A TIME BIT MAP
ELSE MARK TIME INCREMENT USED IN THE TIME BIT MAP
ENDIF
MOVE THE POINTER TO THE NEXT TIME INCREMENT
IF ALL TIME INCREMENTS IN THE TIME SPAN HAVE NOT
BEEN CHECKED
THEN CONTIN~E THE SEARCH
ELSE TRANSMIT THE COMPLETED TIME BIT MAP
~ 20 INDICATING USED AND FREE TIME TO THE REQUESTOR
; SET THE RETURN CODE TO DONE AND RETURN CONTROL
TO CALLING (CALENDAR) ROUTINE
ENDIF
END FREE TIME SEARCH SUBROUTINE
~5 Referring to Figs. 3 through 9, there is shown a plurality of flow diagrams which illustrate the operations of system 21 (Fig. 2) in exchanging entries between a plurality of calendars being maintained in the system. In step 101, an invitor/caller/arranger of a meeting utilizes the user application to invoke one of a plurality of calendar functions. In step 102, the invoked calendar function will update the invitor's local calendar in response to the calendar function ~o be performed and then return control to ~3~3~
the user application. In step 103, control is passed to the invitor's electxonic mail service if required by the invoked calendar function, such as sending a meeting notice or request tc attend a meeting to a plurality of invitees to a meeting being scheduled by the invitor. An invitee's mail service receives the request in step 104 and sets a pointer to a first invitee's/recipient's address within the system 21.
Thereafter, step 106 determines whether a calendar process is to be performed for the first invitee/recipient. If the request is a calendar request, step 107 calls one of a plurality of subrou-tines which is required to perform the calendar request. The plurality of subroutines include func-tions to schedule a meeting, cancel a meeting, reply to a meeting request or a free time search of the invitee's calendar. If the calendar request is to schedule a meeting, control is trans~erred from step 107 to step 108 (Fig~ 4).
In scheduling the meeting, the calendar re-quest/meeting no~ice includes a new entry to be placed on the invitee's calendar. In step 108, the new entry is added to the invitee's calendar. Step 110 deter-mines whether there are any previous/multiple active entries such as more than one meeting invitation for the time slot set ~orth in the meeting notice. If there are no multiple entries for the time slot set forth in the meeting notice, step 112 determines whether the new entry classifies the invitee as a "normal invitee" or is the primary status of the invitee in the meeting notice "normal". Steps 114, 116 and 11~ sets a current primary status equal to "normal", prepares and transmits a tentative accept reply to the invitor, respectively. A calendar alert is sent to the invitee utilizing the mail service in ,, ~ , . ~ ......... ..
,, AT9-86-Og7 step 120. Step 122 sets a current pointer to the new entry. A return code is set to DONE in step 124 and control is then returned to step 107.
If the primary status of the invitee in step 112 S was not normal then the primary status is either key or regular. Step 126 sets the current primary status to the status which is set forth in the meeting notice. Step 128 sets the new entry and current secondary status equal to automatic accept. An 13 automatic acceptance reply is prepared in step 130 and transmitted to the invitor in step 118. Thereafter, a calendar alert is sent to the invitee utilizing the mail service in step 120, step 122 sets the current pointer to the new entry, a return code is set to DONE
15 in step 124 and control is then returned to step 10'7.
I~ there were multiple active entries on the invitee's calendar in step 110, control is transferred to step 132 (Fig. 5). Step 132 determines whether the current secondary status is equal to "accept choice"
~0 which indicates that the invitee has explicitly chosen to attend a particular meeting and meeting invitations received therea~ter will be tentatively rejected.
I'hus, step 134 marks a new secondary status set to "tentative reject" and step 136 prepares the tentative reject reply and control is transferred to step 118 (Fig. 4) to send the reply to the invitor. It should be noted that the new secondary status is marked and not discarded. Thus, the present invention maintains a record or hlstory of all the transactions involving the invitee's calendar.
Step 138 determines whether the current secondary status is equal to "automatic accept". S-tep 140 determines whether a new primary status, which is associated with the new entry, is equal to "key"
subsequent to the current secondary status being equal ~3~3~3 to "automatic accept"~ If the determination in step 140 is negati~e, control is transferred t:o step 134 whereby the new secondary status, which is associated with the new entry, is marked "tentative reject"O As noted above, the new secondary status is marked and not discarded. Thus, the present invention maintains a record or history of all the transactions involving the invitee's calendar.
If the current primary status is equal to key in step 140, step 142 determines whether the current primary status, which is associated with a current entry for the same time span as the new entry on the invitee's calendar, is equal to regular. If the current primary status is not equal to regular, the current primary status is equal to key in view of the current secondary status being equal to automatic accept. Thus, control is transferred to step 134 to tentatively reject the new meeting invitation.
~therwise, if the current primary status is equal to regular, control is transferred to step 144 ~Fig. 6) whereby the current primary status is set equal to the new primary status. Step 146 sets the current and the new entry secondary status equal to "automatic ac-cept". The previous current secondary status is marked "tentative reject" for record purposes in step 148. Step 150 facilitates the transmittal of a tentative reject reply to the previous invitor. An automatic accept reply is prepared in step 152 and control is then transferred to step 118 (~ig. 4) which facilitates the transmittal of the automatic accept reply to the invitor of the meeting being scheduled.
If the current secondary status was not equal to "auto accept" in step 138, step 154 determines whether the current secondary status is equal to "tentative accept". As noted above, the current secondary status ~ 3 ~ 3 ~ 3 which is equal to "tentative acceptl' is associated with a current primary status which is equal to normal. Thus, if the current secondary sta~us is equal to "tentative accept", step 156 determines whether the new primary status is equal to normalO If the determination in s~ep 156 is negative, then the new primary status is equal to key or regular and control is transferred to step 144 (FigO 6) for processing as noted above. Otherwise, control is 10 transferred from step 156 to step 134 for processing as noted above.
If the determination in step 154 is negative, step 158 determines whether the new primary status is equal to normal. Step 160 sets the new secondary status equal to "tentative accept" if the primary status is equal to normal. Thereafter, a tentative accept reply is prepared in step 162 and control is transferred to step 118 ~Fig. 4) for processing as noted above. Otherwise, if the new primary status is not equal to normal, step 164 sets the new secondary status equal to "automatic accept" and an automatic accept reply is prepared in step 166. Control is then transferred from step 166 to step 118 (Fig. 4) for processing as noted above.
Referring to Fig. 7, there is shown a flow diagram for a cancel subroutine which facilitates the cancellation of a previous scheduled meeting on calendars being maintained within the information processing system 21 (Fig. 2). Steps 170 and 172 facilitate the location o~ the scheduled meeting on the calendars associated with the invitees of the meeting. If the meeting was located on the respective calendars, the scheduled meeting is marked cancelled on the respective invitee's calendar in step 174 and a calendar alert is transmitted to the respective ~3~3~3 invitees utilizing the mail service in step 178 to notify the respective invitee of the change which was made on the associated calendar. ~owever, if the meeting was not located in step 172, a cancelled meeting entry is made on the respective invitee's calendar for information purposes. Step 180 sets a return code equal to DONE and control ls returned to step 107 (Fig. 3) for further processing.
Referring to Fig. 8, there is shown a flow diagram for a reply subroutine which facilitates the notification of the invitor of the attendance status of a selected invitee in response to an invitation to a scheduled meeting. Steps 190 and 192 facilitates the location of the scheduled meeting on the invitor's calendar. If the meeting was located, the replier's or invitee's attendance status is updated in step 194 according to the reply which was prepared in response to the meeting notice. Thereafter, in step 196, a calendar alert is transmitted to the invitor utili~ing the mail service to immediately inform the invitor of the invitee's status. Step 198 sets a return code to DONE and control is transferred to step 107 (Fig. 3~
for further processing. If the meeting was not round on the invitor's calendar, the return code is set equal to ENQUEUE and control is transferred to step 107 for further processing.
Referring to Fig. 9, there is shown a flow diagram for a free time search subroutine. In steps 210 and 212, a time span and a time increment or length of free time needed are specified by the invitor/caller of a scheduled meeting. Step 214 compares the time increment with the time intervals on a selected potential invitee's calendar. Step 216 determines whether there are any time intervals on the potential invitee's calendar which match the specified . . .
~3~3~3 time increment. If ther~ are time intervals which are available ~open) on the potential invitee's calendar which match the time increment, the time increment is marked open in a bit map in step 218. If the time intervals found is not available, the time interval ls marked not available (used) in the bit map. Step 222 moves a pointer to the next time interval on the potential invitee's calendar which matches the speci-fied time increment. Step 224 determines whether the search has been completed for the selected invitee and continues the search for other open time intervals on the invitee's calendar until the search is completed.
If the search is completed for the selectecl invitee, the bit map is transmitted to invitor/requestor in step 226. Step 228 sets a return code equal to DONE
and transfers control to step 107 (Fig. 3).
In summary, an end user (invitor) who maintains a calendar on the information processing system 21 ~Fig.
DESCRIPTION
MET~OD OF EXCHANGING ENTRIES
FROM A PLURALITY OF DIFFERENT ELECTRONIC
Field of Invention:
This invention relates in general to electronic calendaring methods, and in particular, to methods of exchanging calendar entries from different calendars.
Background Information:
The prior art has disclosed a number and variety of interactive electronic calendaring systems and methods. The objective of all of these systems is primarily to assist the person who, for a number of - different reasons, maintains a calendar of future events containing various information about the event at entry points on the calendar which relate to the time of the event.
The increase of personal computers and intelli-gent workstations in recent years has made it possible for calendar owners to ~stablish and maintain their calendars on these interactive type data processing systems. Hence, the term "electronic calendaring."
Two general types of interactive electronic calendaring systems have thus evolved in the art. In one type of calendaring system, the owner of the calendar is generally also the user of the workstation and that workstation is generally not a part of a ;larger network. Generally, in these types of sys-tems, the calendar functions involve presenting a screen to the user representing a day calendar divided into a number of time periods or time slots. Each period is capable of displaying a limited amount of ~3~3~ 3 te~t that the user enters. In some systems, the day calendar can scroll vertically to presen1 more time periods to the user or horizontally to present longer text entries~ The operator can generally l'page"
forward or backward and, in most arrangements, can display a requested date. These calendaring methods generally do not limit the type of event that is calendared nor the terminology employed at any of the entry points and, to that extent, function in the same manner as conventional manual calendars or appointment books. The electronic calendaring method and systems do have an advantage over the prior art manual calendaring of events in that the user generally has the ability to scan a time span involving a large number of days and identify calendared events quite rapidly.
The other type of calendaring arrangement that has developed in the prior art involves multi-user environments having a large number of terminals or workstations which are generally part of a larger communication network. Usually these networks have 'been established to permit the users to interact with each other and with data maintained on the system. In ; this environment, a user at a terminal or workstation can send a message to one or more of the other users on the network concurrently, and is noti~ied when the addressees have received and read the message. In most of these environments, each user generally maintains a calendar, and in many of these environ-ments the reason for having a network in which usersinteract, quite often involves user interaction that requires reference to the respective electronic calendars of the users. A considerable amount of time is therefore spent by calendar users in many organiza-tions, with people checking and rearranging their ~3~1 3~
calendars to accommodate various events such as meetings and presentations. Calendar systems have progressed to the point where a person who is calling a meeting can at least view the calendars of a number of users that he intends to invite to a meeting, in order to determine a common available time for the meeting O
In this prior art system, a screen is presented to the meeting originator which requests the data necessary for the system to determine times that all potential attendees would be available. The data requested includes, for example, the length of the mee-ting, a time period during which the meeting should be conducted, the place of the meeting and the names of the attendees. Based on this data, the method returns a screen of available times after inspecting each attendee's day calendar during the time period for free time slots or periods.
The originator then selects the beginning time and end time of the meeting, including the time and date, and invitations are automatically sent to all the attendees, requesting their attendance at the scheduled meeting.
While such an automatic system saves time in finding a convenient meeting time, relative to the manual process, the process is limited to the schedul-ing of meetings based on "free time" as represented by the absence of a calendar entry on each of the in-spected calendars. This approach does not recognize 3Q that some calendar entries are less important than others and, in practice, it is often impossible to find a common period of "free time" for a meeting that involves a large group of people or a meeting involv-ing a number of people whose work requires a large number of meetings.
AT9-a6-047 ~3~3~
The prior art systems are limited to e~amining calendars of others in connection with setting up a meeting. It was soon recognized that there were other situations besides calling a meeting where it would be beneficial to be able to create a "selected viewl' of a number of individual calendars.
A department manager, for example, may have an assignment that can be given to a number of different people in his department. If the calendaring system could display to the manager the calendared events of each of these people which meet a set of search criteria entered into this system interactively by the manager, considerable time and effort could be saved by everyone involved. While time available or free time may be one of the search criteria entered, other criteria such as the relative importance of the events that are calendared to the new assignment, might also provide the manager with more relevant data than just free time. Also, identifying the person who handled the same or similar assignment in the past, similar assignments scheduled in the future or other assign-ments scheduled at the same geographic location or customer could be important criteria for the manager to employ. These deficiencies of the prior art electronic calendaring methods, namely using only free time to find relevant calendar entries, are overcome by the present invention.
Disclosure of the Invention This invention relates to methods of exchanging entries in a plurality of calendars being maintained on an information processing system. The invention enables an end user (invitor) who maintains a calendar on the information processing system to schedule a meeting and invite other end users (invitees) who ~3~3~3 maintain respective calendars on the system to the meeting. The invitor sends each of the invitees a meeting notice or request. The current status of each of the respective invitees is determined in response to receipt of the meeting notice and an entry for the scheduled meeting is automatically entered on the calendar of each invitee based upon the classifi-cation of the invitee as set forth in the meeting notice. A log is maintained o~ each entry or attempt-ed ent~y and its associated status for the invitor andeach of the respective invitees. A reply, which sets forth the invitee's status in regard to the schedule meeting, is prepared and transmitted to the invitor.
Subse~uently, if a seLected invitee's status changes in regard to the scheduled meeting, the invitee's calendar is automatically updated and the invitor is automatically informed of this status change.
DESCRIPTION _F THB DRAWINGS:
Fig. 1 illustrates an interactive workstation in which the method of the present invention may be advantageously employed.
Fig. 2 illustrates an information processing system having a plurality of networks which include the interactive workstations of Fig. 1~
Fig. 3 through 9 flow charts, illustrating the detailed steps of the method of the present invention.
Best Mode for Carrying Out ~he Invention:
Fig. 1 illustrates the functional components of an interactive type data processing workstation or terminal 10 on which the electronic calendaring method of the present invention may be advantageously em-ployed~ The terminal 10 compxises a processing unit 11 which includes a microprocessor block 12, a ~3~L3~ 3 semiconductor memory 13, and a control block 14 which functions to control input/output operations in addition to the interaction between the micro-processor block 12 and the memory unit 13.
The terminal 10 further includes a group of conventional peripheral units including a display device 16, a keyboard 17, a printer 13, a disk storage unit 19, and a modem 20. Since the details of the above-dQscribeâ functional blocks form no part of the present invention and can be found in the prior art, only a brief functional description of each block is set forth, along with-a description of their interac-tions, sufficient to provide a person of ordinary skill in the art with a basis of understanding appli-cants' improved electronic calendaring method.
Processing unit 11 corresponds to the "systemunit" of a personal computer system such as the IBM XT
or IBM AT type systems. Unit 11 is provided with an operating system program which may be one of the many versions of DOS (Disk Operating System) which is normally employed to run the systems. The operating system program is stored in memory 13 along with one or more application programs that the user has select-ed to run. Depending on the capacity of memory 13 and the size of the application programs, portions of these programs, as needed, may be transferred to - memory 13 from the disk storage unit 19 which may include, for example, a 30 megabyte hard disk drive and a diskette drive. The basic function of the dlsk storage unit is to store programs and data that are employed by the system and which may readily be transferred to the memory unit 13 when needed. The function of the diskette drive is to provide a remov-able storage function for entering programs and data into the system, and a vehicle for storing data in a ~3~ 3 form that is readily transportable for use on other terminals or systems.
Display device 16 and keyboard 17 together provide for the lnteractive nature of the terminal 10, in that in normal operation, the interpretation that the system gives to a specific keystroke by the operator depends, in substantially all situations, on what is being displayed to the operator at that point in time.
In some situations, the operator, by entering commands into the system, causes the system to perform a certain ~unction. In other situations, the system requests the entry of certain data, generally by displaying a prompt type of menu/message screen. The depth of the interaction between the operator and the system varies by the type of operating system and the application program, but is a necessary characteristic of terminals on which the method of the present invention may be employed.
The terminal 10 shown in Fig. 1 further includes a pxinter 18, which functions to provide hard copy output of data developed or stored in the terminal 10.
Lastly, the modem 20 functions to transfer data from the terminal of Fig. 1 to a host system through one or more communication links which may be a commercial type link or a dedicated communication link.
Fig. 2 illustrates an information processing system 21 having a first network 22 and a second network 23. Each of the networks 22 and 23 includes a plurality of nodes 25 incorporated therein. The networks 22 and 23 also include host central process-ing unit 27 and 29, respectively. ~s illustrated, a plurality of interactive terminals 10 of the type shown in Fig. 1 are interconnected with each other within each of the networks 22 and 23 through the AT9~86-0~7 .
~313~
respective host processing units 27 and 29, respec-tively. The networks 22 and 23 are coupled together via a communication link 33. Functionally, each of the networks 22 and 23 operates to allow one terminal to communicate with one or more terminals within the information processing system 21 using established communication protocols, so that the various serially connected communication links are transparent to an end-user. Such communiCatiQn systems are well known in the art and are currently in extensive commercial use. Since these communication links per se are not a part of the present invention, only those details that are necessary for an understanding of the method of calendaring an event in the present invention will be described. It should therefore be assumed in the following description, that each interactive terminal 10 in the information processing system 21 has a system node address and a terminal address and that to simplify the description, there is only one individual ~; 20 assigned to each of the terminals within the informa-tion processing system. It should further be assumed that conventional communication services are provided by the networks 22 and 23, such as directory listings of individual calendar owners and shareable resources such as meeting rooms, etc.l which require scheduling.
The information processing system 21 shown in Fig. 2 processes information as various types of data objects such as text data objects, graphic data objects, and calendar data objec~s. Each of thesP
3G data objects are represented by a datastream which comprises a series of structured fields.
The present invention provides communication logic which is necessary to schedule meetings, to respond to meeting invitations and to reschedule or cancel meetings in an automatic manner. For purposes ~3~3~ 6 3 of illustration, at least two end user must maintain calendars on either or the same one of the networks 22 and 23. Moreover, the calendars being maintained on the networks 22 and 23 are available to the communica-tion logic so that access is invisible to the endusers or calendar owners. Thus, each of ~he end users are allowed to schedule calendar events on the other's calendar.
A typical application of the present invention is to invite selected individuals to a meeting which has been scheduled. An end user or caller of the sched-uled meeting sets up a distribution list of invitees and the roles associated with attendance status.
These roles include key a-ttendee, invitee, call-er/arranger of the meetiny, alternate, additionalattendee, receives copy, blind copy, blind copy~invitee. A link is established to invite the selected individuals on the distribution list to the meeting and to accept the individual responses of the meeting invitation. The individual responses, such as "would be attending", "not attending", "sending alternate", I'tentative for the meeting" and "user acknowledge", are stored as part of the status of the scheduled meeting.
In the preferred embodiment of the present invention, there are three types of invitees to any regularly scheduled meeting: normal, regular and key.
A normal invitee is an individual who is invited to this regularly scheduled meeting for the first and possibly the only time. A regular invitee is an individual who is invited to this regularly scheduled meeting as is normally done for this date and time. A
key invitee is an individual who is invited to this regularly scheduled meeting as is normally done or for the first and only time. The meeting will be ~ 3~3~
cancelled or rescheduled if the key invitee can not attend.
In response to the receipt of the invitation to the regularly scheduled meeting, the status or re-sponse of a recipient of the invitation is indicatedas:
Recorded - The meeting invitation was received and the recipient either acknowledges this or simply records the meeting notice on the recipient's calendar.
- ~entative Accept: The recipient has agreed to tentatively attend the meeting.
. - Accepted (Automatic): The recipient has agreed to attend the meeting via some preset response mechanism.
- Accepted (Explicit or Choice~: The recipient has agreed to attend the meeting via a manually generated response.
- Tentative Reject (Conflict): Recipient has tentatively rejected attending the meeting because of a conflict which may or may not be resolved.
- Rejected (Conflict): Recipient has automatically rejected attending the meeting because of a conflict which can not be resolved.
- Rejected (Explicit): Recipient has manually rejected attending the meeting because of a ~ ~1 3~:~3 conflict which can not be resolved.
Shown in Tables 1 and 2 are state diagrams of various scenarios showing the status of an invitee in response to the meeting notice.
Table 1 Multiple Active Entries No No Yes New Entry Key or Regular Yes No New Entry Normal No Yes _ Tentative Accept Procedure X
Automatic Accept Procedure X
Go to Table 2 X
Table 2 Current Accept (Choice) Yes No No No No No No No Current Accept (Auto1 - Yes Yes Yes No No No No Current Tentative Accept - - - - Yes Yes No No New Entry Key - Yes Yes No - - - -Current Regular - No Yes - - - -New Entry Normal - - - ~ No Yes Yes No Tent. Reject Proc. (old) X X
Tent. Reject ProcO (new) X X X X
Auto Accept Proc. (new) X X X
Tent. Accept (new) X
As noted above, all invitees to a regularly scheduled meeting or recipients of a meeting notice are classified as a key, a regular or a normal invitee. A meeting will be automatically scheduled on an lnvitee's/recipient's calendar within the ~ 3 ~ 3 information processing system 21 (Fig. 1) if the invitee's/recipient's classification in the scheduled meeting is higher than that of a previously scheduled meeting on the recipient's calendar for the same date and time. Referring to the state diagram shown in Table 1, the first column sets forth a scenario whereby the recipient does not have anv multiple active or previous entries for the date and time set forth in a new meeting invitation and the new invita-tion classifies the recipient as a key or a regularinvitee. An automatic acceptance procedure is then transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
lS The second column of Table 1 sets forth the scenario whereby the recipient does not have any multiple active entries and the new invitation classi-fies the recipient as a normal invitee. A tentative acceptance procedure is transmitted to the call-er/arranger of the new meeting and the new meeting is tencatively scheduled on the recipient's calendar.
If the recipient's calendar includes multiple active entries for the time and date specified in the new meeting notice, Table 2 sets forth a state diagram which illustrates various scenarios and the recipi-ent's response to the new meeting. In the first column of Table 2, the recipient has explicitly chosen to attend a particular meeting for the time and date specified in the meeting notice. In view of this explicit choice, all new invitations to meetings, irrespective of the classification, will be tentative-ly rejected. Thus, the tentative rejection procedure is transmitted to the caller/arranger of the new meeting.
AT9-86-0~7 ~3~3~
Column two of Table 2 sets forth a scenario whereby the recipient currently has an automatic acceptance to a meeting which classifies the recipient as a key or a regular invitee and the new meeting :~ 5 notlce classifies the recipient as a key invitee.
Column two also sets forth that the current acceptance is not classified as a regular invitee. Since the classification of the current acceptance is the same as the classification set forth in the new meeting notice, the tentative reject procedure is transmitted to the caller/arranger of the new meeti.ng.
Column three of Table 2 sets forth a scenario whereby the recipient currently has an automatic acceptance with the recipient classified as a regular invitee and a new invitation which classifies the recipient as a key invitee. A tentative reject procedure is transmitted to the caller/arranger of the current meeting, an automatic acceptance procedure is transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
Column four sets forth a scenario whereby the reci~ient currently has an automatic acceptance which classifies the recipient as a key or a regular invitee and the new invitation classifies the recipient as a regular or a normal invitee. The tentative reject ~ procedure is transmitted to the caller/arranger of the : new meeting because the classification of the new meeting does not exceed that of the classification of the current acceptance.
Column five sets forth a scenario whereby the ; recipient currently has a tentative acceptance which ~ classifies the recipient as a normal invitee and the -~ new invitation classifies the recipient as a key or a regular invitee. The tentative reject procedure is ~31~3 ~4 transmitted to the callerfarranger of the current meeting, the automatic accept procedure is transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
Column six sets forth a scenario whereby the recipient has a current tentative acceptance with the recipient classified as a normal invitee and the new invitation also classifies the recipient as a normal invitee. The tentative reject procedure is transmit-ted to the caller/arranger of the new meeting.
Columns seven and eight set forth scenarios whereby the recipient of the new meeting notice currently does not have an automatic acceptance or a tentakive acceptance. In column seven, the new invitation classifies the recipient as a normal invitee. The tentative accept procedure is then transmitted to the caller/arranger of the new meeting ; and the new meeting is tentatively scheduled on the recipient's calendar. In column eight, the new invitation classifies the recipient as a key or a regular invitee. 'rhe automatic acceptance procedure is transmitted to the caller/arranger of the new meeting and the new meeting is scheduled on the recipient's calendar.
Set out below is an illustration of a calendar program for generating the exchanging entries in a plurality of calendars being maintained in the infor-mation processing system 21. The calendar program is in program design language from which source code and machine code are derivable. In the present invention, it is to be assumed that system 21 is under mouse and keyboard device control. Moreover, it is to be assumed that the calendar program is invoked from a user application which facilitates a user in the system 21 to access at least two calendars being ~3~3~
maintained in the system. Additionally, the calendar program is able to activate an electronic mail system, such as the PROFS system which is commercially avail-able from the Inter~atlonal Business Machines Corpora-tion. Since the user application and the electronic application is not essential to the present invention, they will not be described in detail.
BEGIN CALENDAR MAIN PROC
The user application invokes o~e of a plurality of calendar functions such as schedule a meeting, irlvite user to a meeting, accept a meeting invitation, reject a meeting invitation, change rneeting attendance status, etc. The invoked calendar func~ion will update the user's local calendar to establish a meeting and then return control to the user application.
; IF THE MAIL SERVICE NEEDS TO BE INVOKED FOR ANY
ITEM SUCH AS INVITING PEOPLE TO A MEETING
THEN INVOKE SENDING MAIL SERVICE
ENDIF
DO IN RESPONSE TO A CALENDAR REQVEST BEING
RECEIVED, THE INFORMATION PROCESSING SYSTEM
DETERMINES FOR EACH INVITEE WHETHER THE
CALENDAR SERVICE IS TO BE INVOKED
ENDDO
IF A REQUEST TO SCHEDULE REGULAR MEETINGS, INVITE
USERS/INVITEES TO A MTG, EXECUTE A FREE TIME
SEARCH, ACCEPT A MTG INVITATION, REJECT A MTG
INVITATION, SEND AN ALTERNATE TO A MEETING, CHANGE MTG ATTENDANCE STATUS, OR CANCEL A MTG
IS RECEIVED
THEN PASS CONTROL TO THE APPROPRIATE ROUTINE
TO ACCOMPLISH THE TASK
~3~3~
ELSE ANOTHER TYPE OF MAIL REQUEST IS
PROCESSED.
ENDIF
(Control is returned to this point after calling the appropriate subroutine) IF THE RETURN CODE FROM THE CALENDAR PROCESS
IS ENQUEUE THE REQUEST
THEN ENQUEUE THE REQUEST AND TEST FOR
THE END OF THE TASK
ELSE
IF THE RETURN CODE INDICATES TASK
COMPLETE (DONE]
THEN TEST FOR END OF TASK
ELSE BUILD A STATUS RECORD TO
INDICATE SOME OTHER TYPE OF
STATUS
TRANSMIT THE STATUS TO
CALLER/ARRANGER
ENDIF
ENDIF
IF ALL INVITEES/RECIPIENTS HAVE BEEN PROCESSED
THEN RETURW CONTROL TO THE SYSTEM
ELSE POINT TO THE NEXT INVITEE/RECIPIENT AND
RETURN CONTROL TO THE SYSTEM TO DETERMINE
THE PROCESS TO BE INVOKED FOR THE NEXT
INVITEE/RECIPIENT
ENDIF
END CALENDAR MAIN PROC
BEGIN MEETING SUBROUTINE
ADD THE NEW ENTRY TO THE INVITEE'S CALENDAR
: IF THERE ARE NO MULTIPLE ACTIVE ENTRIES THEN
IF THE NEW PRIMARY STATUS = NORMAL MTG
.. , .... . ~.. . .... . ~i, ~ 3 ~
TEIEN SET CURRENT PRIMARY STATUS =
NORMAL TENTATIVE ACCEPT AND
PREPARE A TENTATIVE ACCEPT REPLY
ELSE SET CURRENT PRIMARY STATUS = TO
TXE CURRENT STATUS (KEY OR REGULAR~
SET NEW ENTRY AND CURRENT SECONDARY
STATUS = ACCEPT (AUTO~ AND PREPARE AN
ACCEPT (AUTO~ REPLY
ENDIF
ELSE
IF THE CURRENT SECONDARY STATUS = ACCEPT BY
CHOICE
THEN SET THE NEW SECONDARY STATUS =
TENTATIVE REJECT AND PREPARE A
TENTATIVE REJECT REPLY
ELSE
IF THE CURRENT SECONDARY STATUS = ACCEPT
(AUTO) THEN
IF PRIMARY STATUS = KEY
THEN
IF CURRENT PRIMARY STATUS =
REGULAR
THEN SET CURRENT PRIMARY STATUS
= THE NEW PRIMARY STATUS, SET
CURRENT & NEW ENTRY SECONDARY
STATUS = ACCEPT (AUTO, SET
PREVIOUS CURRENT SECONDARY
STATUS = TENTATIVE REJECT, SEND TENTATIVE REJECT REPLY
TO PREVIOUS INVITOR AND
` PREPARE ACCEPT (AUTO) REPLY
j ELSE SET THE NEW SECONDARY STATUS
;~ = TENTATIVE REJECT AND
PRh'PARE A TENTATIVE REJECT
REPLY
,~
., , ~3~1 3~3 ENDIF
ELSE SET THE NEW SECONDARY STATUS =
TENTATIVE REJECT AND PREPARE A
- TENTATIVE REJECT REPLY
ENDIF
ELSE
IF THE CURRENT SECONDARY STATUS =
TENTATIVE ACCEPT THEN
IF NEW PRIMARY STATUS -NORMAL THEN SET THE NEW
SECONDARY STATUS =
TENTATIVE REJECT AND
PREPARE A TENTATIVE REPLY
ELSE SET CURRENT PRIMARY
STATUS = THE NEW PRIMARY
STATUS, SET CURRENT ~ NEW
. ENTRY SECONDARY STATUS =
; ACCEPT (AUTO), SET PREVIOUS
CURRENT SECONDARY STATUS =
TENTATIVE REJECT, SEND
TENTATIVE REJECT REPLY TO
PREVIOUS INVITOR AND
PREPARE ACCEPT (AUTO~ REPLY
ENDIF
ELSE
IF NEW PRIMARY STATUS -NORMAL THEN SET THE NEW
SECONDARY STATUS =
TENTATIVE ACCEPT AND
PREPARE A TENTATIVE ACCEPT
: REPLY
ELSE SET NEW SECONDARY STATUS
= ACCEPT (AUTO) AND PREPARE
ACCEPT (AUTO) REPLY
ENDIF
~3~3~3 ENDIF
ENDIF
ENDIF
ENDIF
SEND PREPARED REPLY TO INVITOR/CALLE:R, MAIL
CALENDAR ALERT TO INVITEE
SET THE CURRENT POINTER TO TEIE NEW ENTRY, SET
RETURN CODE 3 DONE AND ~ETURN TO THE CALLING
(CALENDAR) ROUTINE
END MEETING SUBROUTINE
BEGIN CANCEL SUBROUTINE
LOCATE THE MEETING ON THE INVITEES' CALENDAR
IF THE MEETING IS NOT FOUND
THEN ENTER A CANCELLED MEETING NOTICE ONTO
THE INVITEE'S CALENDAR
: ELSE MARX T~E SUBJECT MEETING CANCELLED ON THE
INVITEE'S CALENDAR, SEND A CALENDAR ALERT TO THE INVITEE, SET THE RETUXN CODE = DONE FOR ANALYSIS AND
RESPONSE ON RETURN AND RETURN CONTROL TO THE
CALLING (CALENDAR) ROUTINE
ENDIF
END CANCEL SUBROUTINE
BEGIN REPLY SUBROUTINE
LOCATE THE MEETING ON THE INVITEES' CALENDAR
IF THE MEETING IS NOT FOUND
THEN SET THE RETURN CODE TO ENQUEUE AND
RETURN TO THE CALLING (CALENDAR~ ROUTIWE
ELSE UPDATE THE REPLIER'S MEETING ATTENDANCE
STATUS PER THE REPLY, SEND A CALENDAR ALERT TO THE INVITEE
SET THE RETURN CODE = DONE FOR ANALYSIS AND
RESPONSE ON RETURN AND RETURN CONTROL TO THE
~3~3~3 CALLING (CALENDAR) ROUTINE
- ENDIF
END REPLY SUBROUTINE
5 . BEGIN FREE TIME SEARCH SUBROUTINE
DETERMINE THE TIME SPAN FOR THE FREE TIME SEARCH
DETERMINE THE LENGTH OF FREE TIME NEEDED (TIME
INCREMENT) CHECK THE CURRENT TIME INCREMENT IN THE TIME SPAN
FOR OPEN TIME
IF THE INCREMENT IS OPEN (FREE) THEN MARK THE TIME OPEN IN A TIME BIT MAP
ELSE MARK TIME INCREMENT USED IN THE TIME BIT MAP
ENDIF
MOVE THE POINTER TO THE NEXT TIME INCREMENT
IF ALL TIME INCREMENTS IN THE TIME SPAN HAVE NOT
BEEN CHECKED
THEN CONTIN~E THE SEARCH
ELSE TRANSMIT THE COMPLETED TIME BIT MAP
~ 20 INDICATING USED AND FREE TIME TO THE REQUESTOR
; SET THE RETURN CODE TO DONE AND RETURN CONTROL
TO CALLING (CALENDAR) ROUTINE
ENDIF
END FREE TIME SEARCH SUBROUTINE
~5 Referring to Figs. 3 through 9, there is shown a plurality of flow diagrams which illustrate the operations of system 21 (Fig. 2) in exchanging entries between a plurality of calendars being maintained in the system. In step 101, an invitor/caller/arranger of a meeting utilizes the user application to invoke one of a plurality of calendar functions. In step 102, the invoked calendar function will update the invitor's local calendar in response to the calendar function ~o be performed and then return control to ~3~3~
the user application. In step 103, control is passed to the invitor's electxonic mail service if required by the invoked calendar function, such as sending a meeting notice or request tc attend a meeting to a plurality of invitees to a meeting being scheduled by the invitor. An invitee's mail service receives the request in step 104 and sets a pointer to a first invitee's/recipient's address within the system 21.
Thereafter, step 106 determines whether a calendar process is to be performed for the first invitee/recipient. If the request is a calendar request, step 107 calls one of a plurality of subrou-tines which is required to perform the calendar request. The plurality of subroutines include func-tions to schedule a meeting, cancel a meeting, reply to a meeting request or a free time search of the invitee's calendar. If the calendar request is to schedule a meeting, control is trans~erred from step 107 to step 108 (Fig~ 4).
In scheduling the meeting, the calendar re-quest/meeting no~ice includes a new entry to be placed on the invitee's calendar. In step 108, the new entry is added to the invitee's calendar. Step 110 deter-mines whether there are any previous/multiple active entries such as more than one meeting invitation for the time slot set ~orth in the meeting notice. If there are no multiple entries for the time slot set forth in the meeting notice, step 112 determines whether the new entry classifies the invitee as a "normal invitee" or is the primary status of the invitee in the meeting notice "normal". Steps 114, 116 and 11~ sets a current primary status equal to "normal", prepares and transmits a tentative accept reply to the invitor, respectively. A calendar alert is sent to the invitee utilizing the mail service in ,, ~ , . ~ ......... ..
,, AT9-86-Og7 step 120. Step 122 sets a current pointer to the new entry. A return code is set to DONE in step 124 and control is then returned to step 107.
If the primary status of the invitee in step 112 S was not normal then the primary status is either key or regular. Step 126 sets the current primary status to the status which is set forth in the meeting notice. Step 128 sets the new entry and current secondary status equal to automatic accept. An 13 automatic acceptance reply is prepared in step 130 and transmitted to the invitor in step 118. Thereafter, a calendar alert is sent to the invitee utilizing the mail service in step 120, step 122 sets the current pointer to the new entry, a return code is set to DONE
15 in step 124 and control is then returned to step 10'7.
I~ there were multiple active entries on the invitee's calendar in step 110, control is transferred to step 132 (Fig. 5). Step 132 determines whether the current secondary status is equal to "accept choice"
~0 which indicates that the invitee has explicitly chosen to attend a particular meeting and meeting invitations received therea~ter will be tentatively rejected.
I'hus, step 134 marks a new secondary status set to "tentative reject" and step 136 prepares the tentative reject reply and control is transferred to step 118 (Fig. 4) to send the reply to the invitor. It should be noted that the new secondary status is marked and not discarded. Thus, the present invention maintains a record or hlstory of all the transactions involving the invitee's calendar.
Step 138 determines whether the current secondary status is equal to "automatic accept". S-tep 140 determines whether a new primary status, which is associated with the new entry, is equal to "key"
subsequent to the current secondary status being equal ~3~3~3 to "automatic accept"~ If the determination in step 140 is negati~e, control is transferred t:o step 134 whereby the new secondary status, which is associated with the new entry, is marked "tentative reject"O As noted above, the new secondary status is marked and not discarded. Thus, the present invention maintains a record or history of all the transactions involving the invitee's calendar.
If the current primary status is equal to key in step 140, step 142 determines whether the current primary status, which is associated with a current entry for the same time span as the new entry on the invitee's calendar, is equal to regular. If the current primary status is not equal to regular, the current primary status is equal to key in view of the current secondary status being equal to automatic accept. Thus, control is transferred to step 134 to tentatively reject the new meeting invitation.
~therwise, if the current primary status is equal to regular, control is transferred to step 144 ~Fig. 6) whereby the current primary status is set equal to the new primary status. Step 146 sets the current and the new entry secondary status equal to "automatic ac-cept". The previous current secondary status is marked "tentative reject" for record purposes in step 148. Step 150 facilitates the transmittal of a tentative reject reply to the previous invitor. An automatic accept reply is prepared in step 152 and control is then transferred to step 118 (~ig. 4) which facilitates the transmittal of the automatic accept reply to the invitor of the meeting being scheduled.
If the current secondary status was not equal to "auto accept" in step 138, step 154 determines whether the current secondary status is equal to "tentative accept". As noted above, the current secondary status ~ 3 ~ 3 ~ 3 which is equal to "tentative acceptl' is associated with a current primary status which is equal to normal. Thus, if the current secondary sta~us is equal to "tentative accept", step 156 determines whether the new primary status is equal to normalO If the determination in s~ep 156 is negative, then the new primary status is equal to key or regular and control is transferred to step 144 (FigO 6) for processing as noted above. Otherwise, control is 10 transferred from step 156 to step 134 for processing as noted above.
If the determination in step 154 is negative, step 158 determines whether the new primary status is equal to normal. Step 160 sets the new secondary status equal to "tentative accept" if the primary status is equal to normal. Thereafter, a tentative accept reply is prepared in step 162 and control is transferred to step 118 ~Fig. 4) for processing as noted above. Otherwise, if the new primary status is not equal to normal, step 164 sets the new secondary status equal to "automatic accept" and an automatic accept reply is prepared in step 166. Control is then transferred from step 166 to step 118 (Fig. 4) for processing as noted above.
Referring to Fig. 7, there is shown a flow diagram for a cancel subroutine which facilitates the cancellation of a previous scheduled meeting on calendars being maintained within the information processing system 21 (Fig. 2). Steps 170 and 172 facilitate the location o~ the scheduled meeting on the calendars associated with the invitees of the meeting. If the meeting was located on the respective calendars, the scheduled meeting is marked cancelled on the respective invitee's calendar in step 174 and a calendar alert is transmitted to the respective ~3~3~3 invitees utilizing the mail service in step 178 to notify the respective invitee of the change which was made on the associated calendar. ~owever, if the meeting was not located in step 172, a cancelled meeting entry is made on the respective invitee's calendar for information purposes. Step 180 sets a return code equal to DONE and control ls returned to step 107 (Fig. 3) for further processing.
Referring to Fig. 8, there is shown a flow diagram for a reply subroutine which facilitates the notification of the invitor of the attendance status of a selected invitee in response to an invitation to a scheduled meeting. Steps 190 and 192 facilitates the location of the scheduled meeting on the invitor's calendar. If the meeting was located, the replier's or invitee's attendance status is updated in step 194 according to the reply which was prepared in response to the meeting notice. Thereafter, in step 196, a calendar alert is transmitted to the invitor utili~ing the mail service to immediately inform the invitor of the invitee's status. Step 198 sets a return code to DONE and control is transferred to step 107 (Fig. 3~
for further processing. If the meeting was not round on the invitor's calendar, the return code is set equal to ENQUEUE and control is transferred to step 107 for further processing.
Referring to Fig. 9, there is shown a flow diagram for a free time search subroutine. In steps 210 and 212, a time span and a time increment or length of free time needed are specified by the invitor/caller of a scheduled meeting. Step 214 compares the time increment with the time intervals on a selected potential invitee's calendar. Step 216 determines whether there are any time intervals on the potential invitee's calendar which match the specified . . .
~3~3~3 time increment. If ther~ are time intervals which are available ~open) on the potential invitee's calendar which match the time increment, the time increment is marked open in a bit map in step 218. If the time intervals found is not available, the time interval ls marked not available (used) in the bit map. Step 222 moves a pointer to the next time interval on the potential invitee's calendar which matches the speci-fied time increment. Step 224 determines whether the search has been completed for the selected invitee and continues the search for other open time intervals on the invitee's calendar until the search is completed.
If the search is completed for the selectecl invitee, the bit map is transmitted to invitor/requestor in step 226. Step 228 sets a return code equal to DONE
and transfers control to step 107 (Fig. 3).
In summary, an end user (invitor) who maintains a calendar on the information processing system 21 ~Fig.
2) may schedule a meeting and invite other end users (invitees) who maintain respective calendars on the system to the meeting. The invitor sends each of the invitees a meeting notice or request. The present invention determines the current status of each of the respective invitees and automatically enters the scheduled meeting on the calendar of each invitee based upon the classification of the invitee set forth in the meeting notice. A log is maintained of each entry or attempted entry and its associated status for the invitor and each of the respective invitees. A
reply, which sets forth the invitee's status in regard to the schedule meeting, is prepared and transmitted to the invitor. Subsequently, if a selected invitee's status changes in regard to the scheduled meeting, the invitee's calendar is automatically updated and the ~ 3 ~ 3 invitor lS automatically informed of this status change.
While th~ invention has been shown and illustrat-ed with reference to a preferred embodiment, it will be understood by those skilled in the art: that various modifications may be made without departing from the spirit of the invention and scope of the appended claims.
.
reply, which sets forth the invitee's status in regard to the schedule meeting, is prepared and transmitted to the invitor. Subsequently, if a selected invitee's status changes in regard to the scheduled meeting, the invitee's calendar is automatically updated and the ~ 3 ~ 3 invitor lS automatically informed of this status change.
While th~ invention has been shown and illustrat-ed with reference to a preferred embodiment, it will be understood by those skilled in the art: that various modifications may be made without departing from the spirit of the invention and scope of the appended claims.
.
Claims (16)
1. In an information processing system, a method of entering an event, which is present on a first calendar being maintained in the system, on a second calendar being maintained in the system, said method comprises the steps of:
requesting the scheduling of said event on said second calendar being maintained by a second user;
automatically entering said event on said second calendar, in response to said request, if said event does not cause a conflict with any event previously scheduled thereon; and transmitting a reply to a first user indicating the status of said second user in regards to said request.
requesting the scheduling of said event on said second calendar being maintained by a second user;
automatically entering said event on said second calendar, in response to said request, if said event does not cause a conflict with any event previously scheduled thereon; and transmitting a reply to a first user indicating the status of said second user in regards to said request.
2. The method as recited in claim 1 wherein said request includes a time period for said event and a classification for the second user.
3. The method as recited in claim 2 further includes the step of determining whether there are any multiple entries on said second calendar for the time period specified in said request.
4. The method as recited in claim 3 further includes the step of comparing the classification included as a part of said request with that associated with said multiple entries found for said time period.
5. The method as recited in claim 4 wherein said automatically entering step includes the step of replacing said multiple entries with said event if the classification associated with said request is higher than that which is associated with said multiple entries.
6. The method as recited in claim 5 further includes the step of transmitting a reply to a third user associated with said multiple entries which sets forth the changed status of said second user if said multiple entries is replaced.
7. The method as recited in claim 1 further includes the step of maintaining a log of all calendar activity on said first and said second calendars.
8. The method as recited in claim 1 wherein said reply transmitted to said first user is a first reply and further includes the step of transmit-ting a second reply to said first user indicating that the status of said second user has changed subsequent to the transmittal of said first reply.
9. In an information processing system, a method of entering an event, which is present on a first calendar being maintained in the system, on a plurality of calendars being maintained in the system, said method comprises the steps of:
requesting the scheduling of said event on said plurality of calendars being maintained by respective users;
automatically entering said event on each of said plurality of calendars, in response to said request, if said event does not cause a conflict with any event previously scheduled on the respective ones of said plurality of calendars;
and transmitting a reply to a first user indicating the status of each of said respective users in regards to said request.
requesting the scheduling of said event on said plurality of calendars being maintained by respective users;
automatically entering said event on each of said plurality of calendars, in response to said request, if said event does not cause a conflict with any event previously scheduled on the respective ones of said plurality of calendars;
and transmitting a reply to a first user indicating the status of each of said respective users in regards to said request.
10. The method as recited in claim 9 wherein said request includes a time period for said event and a classification for each of said respective users.
11. The method as recited in claim 10 further in-cludes the step of determining whether there are any multiple entries on each of said plurality of calendars for the time period specified in said request:
12. The method as recited in claim 11 further in-cludes the step of comparing the classification included in said request with that associated with said multiple entries found for said time period.
13. The method as recited in claim 12 wherein said automatically entering step includes the step of replacing said multiple entries found for said time period with said event if the classification associated with said request is higher than that which is associated with said multiple entries.
14. The method as recited in claim 13 further in-cludes the step of transmitting a reply to an end user associated with said multiple entries found on each calendar of said plurality of calendars setting forth the changed status of each of said respective users if said multiple entries is replaced.
15. The method as recited in claim 9 further includes the step of maintaining a log of all calendar activity on said first and said plurality of calendars.
16. The method as recited in claim 9 wherein said reply transmitted to said first user is a first reply and further includes the step of transmit-ting a second reply to said first user if the respective status of said respective users has changed subsequent to the transmittal of said first reply.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US07/252,282 US5093901A (en) | 1988-09-30 | 1988-09-30 | System for exchanging electronic calendars based on entries and classification among users of the system |
| US07/252,282 | 1988-09-30 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA1313413C true CA1313413C (en) | 1993-02-02 |
Family
ID=22955356
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA000601599A Expired - Fee Related CA1313413C (en) | 1988-09-30 | 1989-06-02 | Method of exchanging entries from a plurality of different electronic calendars in a communication system |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US5093901A (en) |
| EP (1) | EP0361738A3 (en) |
| JP (1) | JPH02116965A (en) |
| CA (1) | CA1313413C (en) |
Families Citing this family (76)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5247661A (en) * | 1990-09-10 | 1993-09-21 | International Business Machines Corporation | Method and apparatus for automated document distribution in a data processing system |
| US5303145A (en) * | 1990-12-26 | 1994-04-12 | International Business Machines Corporation | Method and apparatus for meeting confirmation in a data processing system |
| US5428784A (en) * | 1993-03-05 | 1995-06-27 | International Business Machines Corporation | Method and apparatus for linking electronic mail and an electronic calendar to provide a dynamic response to an electronic mail message |
| US5774867A (en) * | 1993-03-25 | 1998-06-30 | International Business Machines Corporation | Meeting conflict resolution for electronic calendars |
| US6272074B1 (en) | 1993-09-23 | 2001-08-07 | Oracle Corporation | Method and apparatus for generating recurring events in a calendar/schedule system |
| US5761525A (en) * | 1994-03-17 | 1998-06-02 | International Business Machines Corporation | Method and system for scheduling the playback of a multimedia presentation |
| US6496872B1 (en) * | 1994-05-16 | 2002-12-17 | Apple Computer, Inc. | Computer system for automatically instantiating tasks designated by a user |
| US5892947A (en) * | 1996-07-01 | 1999-04-06 | Sun Microsystems, Inc. | Test support tool system and method |
| JPH1091685A (en) * | 1996-09-17 | 1998-04-10 | Hitachi Ltd | Multistage free time retrieval system |
| US5930471A (en) * | 1996-12-26 | 1999-07-27 | At&T Corp | Communications system and method of operation for electronic messaging using structured response objects and virtual mailboxes |
| US6636733B1 (en) | 1997-09-19 | 2003-10-21 | Thompson Trust | Wireless messaging method |
| US6253061B1 (en) | 1997-09-19 | 2001-06-26 | Richard J. Helferich | Systems and methods for delivering information to a transmitting and receiving device |
| US6826407B1 (en) | 1999-03-29 | 2004-11-30 | Richard J. Helferich | System and method for integrating audio and visual messaging |
| US7003304B1 (en) | 1997-09-19 | 2006-02-21 | Thompson Investment Group, Llc | Paging transceivers and methods for selectively retrieving messages |
| US6983138B1 (en) | 1997-12-12 | 2006-01-03 | Richard J. Helferich | User interface for message access |
| JPH11191120A (en) * | 1997-12-26 | 1999-07-13 | Hitachi Ltd | Schedule display method and reserved schedule managing method of schedule management system |
| US6167379A (en) * | 1998-03-24 | 2000-12-26 | Siemens Information And Communication Networks, Inc. | System for user to accept or decline updating a calendar remotely with a proposed schedule update that may have schedule confliction |
| US6396512B1 (en) * | 1998-12-22 | 2002-05-28 | Xerox Corporation | Information sharing system for personal electronic time management systems |
| US6691153B1 (en) | 1999-08-30 | 2004-02-10 | Zaplet, Inc. | Method and system for process interaction among a group |
| US6457045B1 (en) | 1999-08-30 | 2002-09-24 | Zaplet, Inc. | System and method for group choice making |
| US6463461B1 (en) | 1999-08-30 | 2002-10-08 | Zaplet, Inc. | System for communicating information among a group of participants |
| US6505233B1 (en) | 1999-08-30 | 2003-01-07 | Zaplet, Inc. | Method for communicating information among a group of participants |
| US6507865B1 (en) | 1999-08-30 | 2003-01-14 | Zaplet, Inc. | Method and system for group content collaboration |
| US6523063B1 (en) | 1999-08-30 | 2003-02-18 | Zaplet, Inc. | Method system and program product for accessing a file using values from a redirect message string for each change of the link identifier |
| US6453337B2 (en) | 1999-10-25 | 2002-09-17 | Zaplet, Inc. | Methods and systems to manage and track the states of electronic media |
| AU2001252885A1 (en) * | 2000-02-29 | 2001-09-12 | John E. Boyd | A computer-based networking service and method and system for performing the same |
| US7571254B1 (en) * | 2000-05-15 | 2009-08-04 | Access Systems Americas, Inc. | Mutual scheduling of events on handheld computers |
| US7130885B2 (en) * | 2000-09-05 | 2006-10-31 | Zaplet, Inc. | Methods and apparatus providing electronic messages that are linked and aggregated |
| US20020116232A1 (en) * | 2000-12-18 | 2002-08-22 | Rapp Larry J. | System and method for interactive scheduling |
| JP2002297514A (en) * | 2001-03-29 | 2002-10-11 | Sony Corp | Receiver and method, recording medium, and program |
| US20030130882A1 (en) * | 2002-01-09 | 2003-07-10 | Saxon Shuttleworth | System and method for synchronous peer-to-peer appointment scheduling facilitation |
| JP2003223535A (en) * | 2002-01-31 | 2003-08-08 | Fujitsu Ltd | Schedule management method, program, and recording media |
| US7283970B2 (en) * | 2002-02-06 | 2007-10-16 | International Business Machines Corporation | Method and meeting scheduler for automated meeting insertion and rescheduling for busy calendars |
| US7299193B2 (en) * | 2002-02-06 | 2007-11-20 | International Business Machines Corporation | Method and meeting scheduler for automated meeting scheduling using delegates, representatives, quorums and teams |
| US20030217073A1 (en) * | 2002-05-14 | 2003-11-20 | Walther Dan E. | Increasing the level of automation when scheduling and managing meetings |
| US7660904B2 (en) | 2004-05-11 | 2010-02-09 | Microsoft Corporation | Providing keys to share data within an instant messaging session |
| US7702802B2 (en) * | 2004-12-03 | 2010-04-20 | Microsoft Corporation | Sharing framework for resource sharing |
| US7587501B2 (en) * | 2004-12-03 | 2009-09-08 | Microsoft Corporation | System, method, and computer storage medium for establishing sharing of resources with reciprocal requests included in sharing messages |
| US20060149609A1 (en) * | 2004-12-30 | 2006-07-06 | Microsoft Corporation | Calendar rule definition, ranking, and expansion |
| US11475410B1 (en) * | 2005-05-16 | 2022-10-18 | Eventuality, Inc. | Using an automated scheduling agent to generate events and coordinate schedules |
| US8019065B2 (en) * | 2005-05-20 | 2011-09-13 | Research In Motion Limited | Communication device with capability for handling conditional acceptance of meeting requests |
| US20070005409A1 (en) * | 2005-06-30 | 2007-01-04 | International Business Machines Corporation | Method and structure for overriding calendar entries based on context and business value |
| US20070239506A1 (en) * | 2006-04-06 | 2007-10-11 | International Business Machines Corporation | Priority based scheduling system |
| US9058595B2 (en) | 2006-08-04 | 2015-06-16 | Apple Inc. | Methods and systems for managing an electronic calendar |
| US20080126948A1 (en) * | 2006-09-14 | 2008-05-29 | International Business Machines Corporation | Method for retaining and acting on rejected electronic meetings |
| US7747458B2 (en) * | 2006-10-11 | 2010-06-29 | International Business Machines Corporation | Electronic calendar auto event resolution system and method |
| US20080162614A1 (en) * | 2006-12-28 | 2008-07-03 | Nokia Corporation | Apparatus, method and computer program product providing calendar application with automatic decision making for received invitation based on parameter sets |
| US20080186807A1 (en) * | 2007-02-02 | 2008-08-07 | Research In Motion Limited | Electronic device and method of controlling an electronic device for calendar event updates |
| US9552571B2 (en) * | 2007-02-02 | 2017-01-24 | Blackberry Limited | Electronic device and method of meeting notification |
| US20080195619A1 (en) * | 2007-02-09 | 2008-08-14 | Jain Rohit Rocky | Electronic device and method of sharing calendar-event information |
| US20080195455A1 (en) * | 2007-02-09 | 2008-08-14 | Research In Motion Limited | Electronic device and method of scheduling calendar events |
| US20080191896A1 (en) * | 2007-02-09 | 2008-08-14 | Jain Rohit Rocky | Electronic device and method of adding parties to a calendar event |
| EP1956534A1 (en) * | 2007-02-09 | 2008-08-13 | Research In Motion Limited | Method of processing calendar events, and associated handheld electronic device |
| US7849056B2 (en) * | 2007-02-09 | 2010-12-07 | Research In Motion Limited | System and method for managing databases associated with respective personal information manager service accounts |
| US20090063239A1 (en) * | 2007-08-30 | 2009-03-05 | Ibm Corporation | Method and Apparatus for Providing an Electronic Calendar with an Indication of Timeslot Availability Dependent on the Importance of a Requester |
| US20090063993A1 (en) * | 2007-08-31 | 2009-03-05 | International Business Machines Corporation | System and method for workflow to allow meeting invitees to subscribe as dependents of other invitees |
| US20090099896A1 (en) * | 2007-10-15 | 2009-04-16 | International Business Machines Corporation | System and method for workflow delinquency remediation |
| US8091035B2 (en) * | 2007-11-08 | 2012-01-03 | International Business Machines Corporation | System and method for sharing data |
| US20090165022A1 (en) * | 2007-12-19 | 2009-06-25 | Mark Hunter Madsen | System and method for scheduling electronic events |
| US20090193087A1 (en) * | 2008-01-27 | 2009-07-30 | David Lee | System and method for configurable meeting invitation notification on unopened/unaccepted invitations |
| US7992089B2 (en) * | 2008-01-29 | 2011-08-02 | International Business Machines Corporation | Visualization of meeting invitee status as a method of collaboration |
| US20090210351A1 (en) * | 2008-02-15 | 2009-08-20 | Bush Christopher L | System and Method for Minimizing Redundant Meetings |
| US20090282348A1 (en) * | 2008-05-09 | 2009-11-12 | International Business Machines Corporation | Method and system for enhanced management of meeting cancellations |
| US8626552B2 (en) * | 2009-03-26 | 2014-01-07 | International Business Machines Corporation | Quorum management of appointment scheduling |
| US8375081B2 (en) * | 2009-12-28 | 2013-02-12 | Microsoft Corporation | Calendar repair assistant |
| US11144859B1 (en) * | 2010-02-19 | 2021-10-12 | Wells Fargo Bank, N.A. | Computerized appointment scheduling system and method |
| US8407302B2 (en) | 2010-06-30 | 2013-03-26 | International Business Machines Corporation | Managing meeting invitations to sub-invitees |
| US8639236B2 (en) * | 2011-08-12 | 2014-01-28 | Blackberry Limited | System and method for controlling a function of an electronic device through a network |
| US20130317873A1 (en) * | 2012-05-22 | 2013-11-28 | International Business Machines Corporation | Meeting attendance planner |
| US20130317876A1 (en) * | 2012-05-23 | 2013-11-28 | Mimi Lau | Systems ands methods for automated scheduling |
| US9274687B1 (en) | 2013-10-11 | 2016-03-01 | Google Inc. | Managing schedule changes for correlated calendar events |
| US9531651B1 (en) | 2014-02-13 | 2016-12-27 | Google Inc. | Methods for displaying notifications |
| US20160328681A1 (en) * | 2015-05-08 | 2016-11-10 | Microsoft Technology Licensing, Llc | Computerized customization of default actions |
| US11337778B2 (en) | 2017-06-21 | 2022-05-24 | Sdc U.S. Smilepay Spv | Distributed system for fabricating dental aligners |
| US11253409B2 (en) | 2017-06-21 | 2022-02-22 | Sdc U.S. Smilepay Spv | Systems and methods for mobile dentition scanning |
| US10636522B2 (en) | 2017-06-21 | 2020-04-28 | SmileDirectClub LLC | Arrangements for intraoral scanning |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4194196A (en) * | 1977-10-25 | 1980-03-18 | Mohiuddin Mohammed S | Illuminated master calendar and message recording system |
| US4645238A (en) * | 1983-04-21 | 1987-02-24 | International Business Machines Corporation | Annotated calendar assembly |
| US4626836A (en) * | 1983-11-04 | 1986-12-02 | International Business Machines Corp. | Method of scheduling meetings |
| US4591840A (en) * | 1983-11-04 | 1986-05-27 | International Business Machines Corp. | Calendar event description abbreviation |
| US4807155A (en) * | 1987-01-29 | 1989-02-21 | International Business Machines Corporation | Electronic calendaring method for confirmation of resource availability during event calendaring |
| US4819191A (en) * | 1987-01-29 | 1989-04-04 | International Business Machines Corporation | Electronic calendaring method to establish calendar floating triggers for calendared events and processes |
| US4866611A (en) * | 1987-01-29 | 1989-09-12 | International Business Machines Corporation | Method for automatically reconciling entries on two copies of independently maintained electronic calendars |
| US4807154A (en) * | 1987-01-29 | 1989-02-21 | International Business Machines Corporation | Method for developing automatic replies in an interactive electronic calendaring system |
| US4817018A (en) * | 1987-01-29 | 1989-03-28 | International Business Machines Corporation | Electronic calendaring method which provides for automatic assignment of alternates in requested events |
| US4831552A (en) * | 1987-01-29 | 1989-05-16 | International Business Machines Corporation | Method for concurrently displaying entries from a plurality of different electronic calendars based on interactively entered non-temporal criteria |
| US4896306A (en) * | 1987-07-17 | 1990-01-23 | Casio Computer Co., Ltd. | Electronic scheduler capable of searching schedule data based on time |
-
1988
- 1988-09-30 US US07/252,282 patent/US5093901A/en not_active Expired - Fee Related
-
1989
- 1989-06-02 CA CA000601599A patent/CA1313413C/en not_active Expired - Fee Related
- 1989-08-11 JP JP1207110A patent/JPH02116965A/en active Pending
- 1989-09-14 EP EP19890309357 patent/EP0361738A3/en not_active Withdrawn
Also Published As
| Publication number | Publication date |
|---|---|
| EP0361738A2 (en) | 1990-04-04 |
| EP0361738A3 (en) | 1991-08-21 |
| US5093901A (en) | 1992-03-03 |
| JPH02116965A (en) | 1990-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA1313413C (en) | Method of exchanging entries from a plurality of different electronic calendars in a communication system | |
| EP0323702B1 (en) | Electronic calendar supporting workstations | |
| CA1307855C (en) | Method to facilitate a reply to electronic meeting invitation in an interactive multi-terminal system employing electronic calendars | |
| US5317683A (en) | Method and apparatus for automated meeting agenda generation in a data processing system | |
| US5261045A (en) | Method of exchanging entries from a plurality of different electronic calendars based on interactively entered criteria | |
| US4831552A (en) | Method for concurrently displaying entries from a plurality of different electronic calendars based on interactively entered non-temporal criteria | |
| EP0276428B1 (en) | An electronic calendaring method for use in data processing system | |
| US7702737B2 (en) | Workflow systems and methods for project management and information management | |
| US6587831B1 (en) | System and method for online scheduling and shift management | |
| US7925529B2 (en) | Method and meeting scheduler for automated meeting scheduling using delegates, representatives, quorums and teams | |
| US5276869A (en) | System for selecting document recipients as determined by technical content of document and for electronically corroborating receipt of document | |
| US6988128B1 (en) | Calendar events and calendar-driven application technique | |
| US6640230B1 (en) | Calendar-driven application technique for preparing responses to incoming events | |
| EP0276425A2 (en) | Calendaring method developing automatic replies for use in a data processing system | |
| EP0475872A2 (en) | Method and appparatus for automated procedure initiation in a data processing system | |
| WO1998029994A1 (en) | A communications system and method of operation for electronic messaging using structured response objects and virtual mailboxes | |
| US8050954B2 (en) | Method and system for automated meeting scheduling | |
| US20040215535A1 (en) | Method and system for automated meeting scheduling | |
| EP0323703A2 (en) | Interrogating electronic calendars | |
| JPH06332906A (en) | Conference schedule adjusting method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| MKLA | Lapsed |