The invention relates generally to enterprise scheduling applications and particularly to calendaring applications.
Personal information managers, such as Microsoft Outlook™, provide calendar, task, and contact management, note taking, journal ability, and e-mail service. It can be used as a stand-alone application but can also operate in conjunction with Microsoft Exchange Server™ to provide enhanced functions for multiple users in an organization, such as shared mailboxes and calendars, public folders, and meeting time allocation.
Personal information managers commonly include a calendar organizer allowing a person to schedule meetings with multiple people. The manager sends out invitations and invitation updates and allows the person to book enterprise resources, such as meeting rooms, projectors, and the like.
Personal information managers generally have a number of drawbacks. First, managers do not identify existing and/or requested meetings for possible merger. This can be particularly important for organizing meetings with multiple “popular” people. People, such as company directors, team leaders, sales people, and people involved in public relations, are often difficult to get in a meeting together, commonly because they are already booked in other meetings. Second, to protect the owner's privacy and prevent breach of security, managers generally indicate only that a subscriber is “busy” or “available” without indicating what he or she is doing. Third, managers can be poor in permitting users to get added to existing meetings. A user seeking to set up meetings with an individual is notified that they are unavailable without an indication of why or for how long. It is entirely possible that the desired cluster of people already have a confidential meeting scheduled to which the user could be added.
These and other needs are addressed by the various embodiments and configurations of the present invention. The present invention is directed generally to providing meeting notifications and/or enabling meeting mergers.
In a first embodiment of the present invention, a method is provided that includes the steps of:
In a second embodiment, an information manager is provided that includes:
In yet another embodiment, the information manager further includes:
The present invention can provide a number of advantages depending on the particular configuration. For example, it can identify existing and/or requested meetings. It can initiate automatically merger of substantially similar meetings. This can be particularly important for organizing meetings with multiple “popular” people, such as company directors, team leaders, sales people, and people involved in public relations. Automatically merging meetings can conserve, often scarce, resources (e.g., one room is booked for the merged meeting rather than multiple rooms at the same or different times, a single audio bridge can be used instead of two), provide increased employee efficiency (e.g., employees do not have to reconvene to discuss matters already discussed at another meeting), and provide time savings (e.g., meeting organizers do not have to find alternate, suitable times for multiple participants). It can indicate not only that a subscriber is “busy” or “available” but also indicate what meetings he or she is involved in. It readily permits users to get added to existing meetings. The present invention can offer these advantages without compromising secrecy and privacy concerns. The operations of the meeting notification and/or merge agent can be restricted such that meeting details are disclosed only to authorized persons and/or subject to disclosure restrictions imposed by meeting participants.
These and other advantages will be apparent from the disclosure of the invention(s) contained herein.
As used herein, “at least one”, “one or more”, and “and/or” are open-ended expressions that are both conjunctive and disjunctive in operation. For example, each of the expressions “at least one of A, B and C”, “at least one of A, B, or C”, “one or more of A, B, and C”, “one or more of A, B, or C” and “A, B, and/or C” means A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B and C together.
The above-described embodiments and configurations are neither complete nor exhaustive. As will be appreciated, other embodiments of the invention are possible utilizing, alone or in combination, one or more of the features set forth above or described in detail below.
The WAN 104 and LAN 116 are commonly packet-switched networks. The WAN 104 preferably conveys packets using the TCP/IP suite of protocols, and the LAN 116 using the Ethernet protocol. As will be appreciated, other protocols may be employed depending on the application.
The client devices 108 and 124a-n can be wired or wireless. Examples of suitable client devices include a Personal Computer, a laptop, a Personal Digital Assistant, telephony endpoints and applications that support calendar functions, and the like.
The subscriber database 120 includes subscriber information, such as subscriber identities, electronic addresses, scheduling information (e.g., calendars), task lists, contact management information and preferences, shared mailboxes, public folders, and organization and areas of responsibility.
An example of a set of data structures used for scheduling information is shown in
Each timeslot corresponds to a discrete time period of a set length, e.g., fifteen, thirty, or sixty minutes. Each timeslot may have an associated set of parameters, such as a task to be performed, a meeting, a list of meeting participants, a subject of the meeting, an agenda for the meeting, attachments for the meeting, a duration of the meeting, contact details for the meeting (e.g., a telephone number of a meeting participant, conference bridge, and the like), and physical location. The parameters are typically referenced in the appropriate timeslot by a pointer. As will be appreciated, when the same timeslot of a number of individuals corresponds to the same meeting, the timeslots normally contain or point to identical meeting information.
Referring again to
The calendar and messaging modules 128 and 132 are conventional.
The meeting notification agent 136 receives from potential meeting participants, whether subscribers or nonsubscribers, and responds to requests respecting the possible existence of one or more meetings complying with stipulated search parameters. The stipulated search parameters include one or more of a set of participant identities (which may be inclusive (e.g., “a meeting in which A and B are present”) and/or exclusive (e.g., “a meeting in which A and B are not present”)), a time period during which eligible meetings are scheduled (e.g., days and/or time periods within a day), a subject of the meeting (e.g., “a meeting regarding item X”), one or more agenda items for the meeting (e.g., “a meeting regarding agenda item Y”), an attachment for the meeting (e.g., “a meeting in which document ‘Z’ will be discussed”), a duration of the meeting, and contact details for the meeting (e.g., a telephone number of a meeting participant, conference bridge number, and the like).
Any meetings satisfying the search parameters are reviewed by the agent 136, prior to disclosure of the meeting details to the requestor, to determine whether the requestor is privileged to be notified of the existence of the meeting and/or the meeting details. Alternatively or additionally, the agent 136, prior to disclosure of the meeting details to the requestor, determines whether the organizer and/or current meeting participants have designated the meeting to be restricted. In one configuration, a restricted meeting means that there are restrictions on the publication of the existence and/or details of the meeting to unauthorized or unprivileged requestors. A fully restricted or confidential meeting means that the existence of the meeting is not published to unauthorized requestors. A partially restricted meeting means that the existence of the meeting, but not selected details of the meeting, may be disclosed to unauthorized persons. If the requestor is not privileged to learn of the existence of the meeting and/or receive the meeting details or if the meeting is otherwise designated as being restricted, an appropriate response, which is often different from or a filtered version of the search results, is provided to the requestor. For example, for a restricted or confidential meeting and/or an unprivileged requestor the response could be that “no such meetings exist.” Alternatively, for a partially restricted meeting and/or an unauthorized requestor the response could be that “such a meeting exists but further details cannot be provided at this time.” In this manner, organizational security and subscriber privacy issues are honored.
According to one configuration, a map of what search results may be disclosed is as follows:
The meeting merge agent 144 identifies potential meetings for merger and, if acceptable to the affected organizers and/or meeting participants, merges the meetings. For example, assume meeting organizer “A” schedules a meeting for a specific time and duration with a particular set of participants. Further assume a second meeting organizer “B” attempts to set a meeting at a timeslot that directly conflicts with the meeting organized by “A”. The merger agent 144 performs a check of the set of participants in both meetings and, if the sets of participants for the meetings are sufficiently similar, presents “B” with an option to request a meeting merger with “A”. If “B” accepts the option, a request is sent to “A” informing him or her that both A's and B's meetings are scheduled for approximately the same time with sufficiently similar meeting participants. The request sent to “A” will ask if he or she will agree to the meeting merger. If the request is accepted by “A”, the meetings are merged. As will be appreciated, the agent 144 identifies, for possible merger, not only overlapping meetings but also meetings that are temporally adjacent to one another.
In one configuration, the sets of participants are deemed to be “sufficiently similar” if at least a selected percentage or number of participants are common to both sets. For example, for two meetings, each of three participants, the meetings are deemed to be sufficiently similar if at least two of the three participants are in both meetings.
In another configuration, two meetings are deemed to be “sufficiently similar” if they are temporally adjacent to one another. Two meetings are deemed to be temporally adjacent if the two meetings are scheduled to take place within a selected time interval. For example, the two meetings are deemed to be temporally adjacent when they are scheduled to occur within the same week, same day, etc.
In other configurations, meetings are deemed to be “sufficiently similar” if one or more of the timeslot parameters are shared. For example, if the two meetings have a common subject, agenda item, or attachment, they are deemed to be sufficiently similar, even if the sets of participants of the two meetings are not sufficiently similar.
The operation of the meeting notification agent 136 will now be discussed with reference to
The process starts in block 300 when a search request is received from a subscriber or nonsubscriber. An exemplary search request is shown in
In step 304, the agent 136 generates, from the request, a structured query for the database 120 and, in step 308, forwards the query to the API 140.
In step 312, the API performs the search of the database 120 to locate any meeting(s) satisfying the information inputted into the search fields and returns a response to the agent 136.
In decision diamond 316, the agent 136 determines whether or not a match was found. If not, the agent 136, in step 328, notifies the requestor that no match was found. If a match was found, the agent 136 proceeds to decision diamond 320.
In decision diamond 320, the agent 136 determines whether the requestor can be notified of the results. As noted, this decision diamond can be based on the authority level of the requestor and/or the stipulated level of restrictions/permissions attached to the meeting by the organizer. In one configuration, the decision is based on a combination of the two criteria in accordance with the mapping table above. For example, even though the meeting is designated as being confidential by the organizer, the existence and/or details of the meeting may still be provided to the requestor if the requestor is a supervisor of the meeting participants. To establish that the requestor has the requisite authority, the requestor can be subjected to an authentication procedure in which the requestor is asked to provide a password before the meeting details will be provided.
If the requestor is not entitled to be notified of the search results, the agent 136 proceeds to step 328. The requestor receives no feedback from the agent 136 that hints at the existence of a matching meeting. In one configuration, the update fields 508a-d are forwarded to the organizer and/or selected participants of the matching meeting so that they are aware of the request and can contact the requestor independently of the agent 136.
If the requestor is entitled to be notified of the search results, the agent 136, in decision diamond 324, determines the level of meeting details that may be provided to the requestor. As in the case of decision diamond 320, this determination can be based on the authority level of the requestor and/or the stipulated level of restriction attached to the meeting by the organizer.
When the requestor is authorized to receive the details of the meeting or when the meeting is open (i.e., not designated as being at least partially restricted), the agent 136, in step 332, provides a notification to the requestor providing the permitted meeting information. This information typically includes the list of meeting participants, the meeting location, the meeting time and duration, and the meeting subject matter. In one configuration, the agent 136 forwards the update fields 508a-d to the matching meeting organizer and/or selected participants of the matching meeting giving them an opportunity to agree to the proposed meeting modification. The organizer and/or selected participants could respond, “yes” to accept the modifications or “no” to refuse the modifications. A refusal may or may not be accompanied by an explanation, such as “adding you to the agenda would be inappropriate because people unrelated to Project X will be attending.”
When the requestor is not authorized to receive the details of the meeting and the meeting is designated as being at least partially restricted, the agent 136, in step 336, provides an invitation, containing the contents of the update fields 508a-d, to one or more selected participants of the meeting, which matched the query. The selected participants generally include the meeting organizer.
In decision diamond 340, the agent 136 determines whether a response has been received from each of the selected participants within a timeout period. If not, the agent proceeds to step 348 and notifies the requestor that a meeting exists but no other information may be currently provided. The requestor may contact independently one or more of the participants in an attempt to be included within the meeting.
If a response is received from each of the selected participants within the timeout period, the agent 136 proceeds to decision diamond 344 and determines whether each of the selected participants accepted the invitation, or indicated that the meeting may be updated as requested in the update fields. If not, the agent 136 proceeds to step 348. If so, the agent 136 proceeds to step 332 and provides the requestor and current meeting participants with a copy of the acceptance of the invitation and the updated meeting details.
Where multiple matches are found, the agent 136 may notify the requestor, if permitted, of each of the matches or may notify the requestor of only the meeting that is the “best” match. Predefined rules may define which of a number of matching meetings is the “best match.” In one configuration, an interactive session with the requestor is conducted after the search is performed to filter the various matches down to the best match. In the session, the user is asked for additional details that would be desired in a match. The additional details may also be requested before the search is performed.
The operation of the meeting merge agent 144 will now be discussed with reference to
The process starts in block 400 when the agent 144 receives a request to schedule a meeting involving a set of participants and all or some of the timeslot meeting fields noted above.
The agent 144 automatically generates a structured query of the subscriber database 120 using, in the search fields, a subset of the meeting information received in the request. The subset of information is defined in a set of rules defining what degree of similarity is needed for the requested meeting and an existing meeting to be “sufficiently similar.” In other words, matching meetings must be meetings that are sufficiently similar to the requested meeting, and the query contains the minimum information required for the requested meeting and another meeting to be “sufficiently similar.” For example, the query may require only two of the three meeting participants to be present, the meeting to be on-site, and the meeting to be scheduled within three days of the requested meeting.
The agent 144 forwards the structured query to the API 140 in step 412.
In step 412, the API 140 executes the search set forth in the query and provides a response to the agent 144.
In decision diamond 416, the agent 144 determines whether any matching meetings were identified. When no matching meetings are identified, the agent 144 proceeds to step 428 and processes the meeting scheduling request or invitation in the normal manner. When a match is found, the agent 144 proceeds to step 420.
In step 420, the agent 144 sends a meeting merge request first to the requestor and then to the existing meeting organizer to approve the proposed merger. An exemplary merger invitation is shown in
In decision diamond 424, the merger agent determines whether both the requestor and matching meeting organizer have accepted the invitation to merge the meetings. If not, the agent 144 performs normal processing of the meeting request in step 428. If the invitation is accepted by both parties, the agent 144 sets up a merged meeting in step 432.
The merged meeting, when accepted by both parties, is set up according to predetermined rules. Exemplary rules include:
In one configuration, the proposed merged meeting details (e.g., start time, duration, location, participants, and subject matter) are provided to the requestor in the merger invitation 600. The requestor may edit the proposed merged meeting details before, or as a condition of, acceptance. The revised, proposed merged meeting details are then provided in a second merger invitation 600 to the organizer of the matching meeting. The organizer can further revise the merged meeting details before acceptance. A further invitation is then sent to the requestor indicating the further revised merged meeting details. The process is continued until the requestor and organizer have agreed on the revised meeting details.
As will be evident from the above discussion, more than two meetings may be merged depending on the application.
A number of variations and modifications of the invention can be used. It would be possible to provide for some features of the invention without providing others.
For example in one alternative embodiment, subscribers only and not nonsubscribers can perform searches for other subscribers' meetings and agree to meeting mergers.
In yet another embodiment, dedicated hardware implementations including, but not limited to, Application Specific Integrated Circuits or ASICs, programmable logic arrays, and other hardware devices can likewise be constructed to implement the methods described herein. Furthermore, alternative software implementations including, but not limited to, distributed processing or component/object distributed processing, parallel processing, or virtual machine processing can also be constructed to implement the methods described herein.
It should also be stated that the software implementations of the present invention are optionally stored on a tangible storage medium, such as a magnetic medium like a disk or tape, a magneto-optical or optical medium like a disk, or a solid state medium like a memory card or other package that houses one or more read-only (non-volatile) memories. A digital file attachment to e-mail or other self-contained information archive or set of archives is considered a distribution medium equivalent to a tangible storage medium. Accordingly, the invention is considered to include a tangible storage medium or distribution medium and prior art-recognized equivalents and successor media, in which the software implementations of the present invention are stored.
Although the present invention describes components and functions implemented in the embodiments with reference to particular standards and protocols, the invention is not limited to such standards and protocols. Other similar standards and protocols not mentioned herein are in existence and are considered to be included in the present invention. Moreover, the standards and protocols mentioned herein and other similar standards and protocols not mentioned herein are periodically superseded by faster or more effective equivalents having essentially the same functions. Such replacement standards and protocols having the same functions are considered equivalents included in the present invention.
The present invention, in various embodiments, includes components, methods, processes, systems and/or apparatus substantially as depicted and described herein, including various embodiments, sub combinations, and subsets thereof. Those of skill in the art will understand how to make and use the present invention after understanding the present disclosure. The present invention, in various embodiments, includes providing devices and processes in the absence of items not depicted and/or described herein or in various embodiments hereof, including in the absence of such items as may have been used in previous devices or processes, e.g., for improving performance, achieving ease and\or reducing cost of implementation.
The foregoing discussion of the invention has been presented for purposes of illustration and description. The foregoing is not intended to limit the invention to the form or forms disclosed herein. In the foregoing Detailed Description for example, various features of the invention are grouped together in one or more embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the following claims are hereby incorporated into this Detailed Description, with each claim standing on its own as a separate preferred embodiment of the invention.
Moreover, though the description of the invention has included description of one or more embodiments and certain variations and modifications, other variations and modifications are within the scope of the invention, e.g., as may be within the skill and knowledge of those in the art, after understanding the present disclosure. It is intended to obtain rights which include alternative embodiments to the extent permitted, including alternate, interchangeable and/or equivalent structures, functions, ranges or steps to those claimed, whether or not such alternate, interchangeable and/or equivalent structures, functions, ranges or steps are disclosed herein, and without intending to publicly dedicate any patentable subject matter.
The present application claims the benefits under 35 U.S.C. §119(e) of U.S. Provisional Application Ser. No. 60/799,223, of the same title, filed May 10, 2006, to Blair, Michaelis and Wan, which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4819191 | Scully et al. | Apr 1989 | A |
4831552 | Scully et al. | May 1989 | A |
5050077 | Vincent | Sep 1991 | A |
5124912 | Hotaling et al. | Jun 1992 | A |
5195086 | Baumgartner et al. | Mar 1993 | A |
5197000 | Vincent | Mar 1993 | A |
5206903 | Kohler et al. | Apr 1993 | A |
5216603 | Flores et al. | Jun 1993 | A |
5323314 | Baber et al. | Jun 1994 | A |
5428784 | Cahill, Jr. | Jun 1995 | A |
5555346 | Gross et al. | Sep 1996 | A |
5619555 | Fenton et al. | Apr 1997 | A |
5627978 | Altom et al. | May 1997 | A |
5774867 | Fitzpatrick et al. | Jun 1998 | A |
5793365 | Tang et al. | Aug 1998 | A |
5813013 | Shakib et al. | Sep 1998 | A |
5828747 | Fisher et al. | Oct 1998 | A |
5889945 | Porter et al. | Mar 1999 | A |
5893073 | Kasso et al. | Apr 1999 | A |
5905793 | Flockhart et al. | May 1999 | A |
5920701 | Miller et al. | Jul 1999 | A |
5960406 | Rasansky et al. | Sep 1999 | A |
5963913 | Henneuse et al. | Oct 1999 | A |
5982873 | Flockhart et al. | Nov 1999 | A |
6064976 | Tolopka | May 2000 | A |
6085166 | Beckhardt et al. | Jul 2000 | A |
6101480 | Conmy et al. | Aug 2000 | A |
6147685 | Bliss et al. | Nov 2000 | A |
6163607 | Bogart et al. | Dec 2000 | A |
6173053 | Bogart et al. | Jan 2001 | B1 |
6192111 | Wu | Feb 2001 | B1 |
6192122 | Flockhart et al. | Feb 2001 | B1 |
6272074 | Winner | Aug 2001 | B1 |
6360217 | Gopal et al. | Mar 2002 | B1 |
6363352 | Dailey et al. | Mar 2002 | B1 |
6377965 | Hachamovitch et al. | Apr 2002 | B1 |
6434571 | Nolte | Aug 2002 | B1 |
6570555 | Prevost et al. | May 2003 | B1 |
6594637 | Furukawa et al. | Jul 2003 | B1 |
6640230 | Alexander et al. | Oct 2003 | B1 |
6662309 | Ando et al. | Dec 2003 | B2 |
6675356 | Adler et al. | Jan 2004 | B1 |
6694335 | Hopmann et al. | Feb 2004 | B1 |
6731323 | Doss et al. | May 2004 | B2 |
6988128 | Alexander et al. | Jan 2006 | B1 |
7007235 | Hussein et al. | Feb 2006 | B1 |
7016909 | Chan et al. | Mar 2006 | B2 |
7027995 | Kaufman et al. | Apr 2006 | B2 |
7035865 | Doss et al. | Apr 2006 | B2 |
7082402 | Conmy et al. | Jul 2006 | B2 |
7113797 | Kelley et al. | Sep 2006 | B2 |
7130885 | Chandra et al. | Oct 2006 | B2 |
7149810 | Miller et al. | Dec 2006 | B1 |
7155435 | Day et al. | Dec 2006 | B1 |
7187384 | Noyle | Mar 2007 | B2 |
7188073 | Tam et al. | Mar 2007 | B1 |
7254569 | Goodman et al. | Aug 2007 | B2 |
7334000 | Chhatrapati et al. | Feb 2008 | B2 |
7343312 | Capek et al. | Mar 2008 | B2 |
7343313 | Dorenbosch et al. | Mar 2008 | B2 |
7353466 | Crane et al. | Apr 2008 | B2 |
7363590 | Kerr et al. | Apr 2008 | B2 |
7383291 | Guiheneuf et al. | Jun 2008 | B2 |
7383303 | Bort | Jun 2008 | B1 |
7395221 | Doss et al. | Jul 2008 | B2 |
7436654 | Cho | Oct 2008 | B2 |
7440961 | Matousek | Oct 2008 | B1 |
7519672 | Boss et al. | Apr 2009 | B2 |
7595717 | Boss et al. | Sep 2009 | B2 |
7693734 | Christenson et al. | Apr 2010 | B2 |
20010054072 | Discolo et al. | Dec 2001 | A1 |
20020085701 | Parsons et al. | Jul 2002 | A1 |
20020117847 | Ede et al. | Aug 2002 | A1 |
20020120600 | Schiavone et al. | Aug 2002 | A1 |
20020144136 | Stornetta et al. | Oct 2002 | A1 |
20030046304 | Peskin et al. | Mar 2003 | A1 |
20030069880 | Harrison et al. | Apr 2003 | A1 |
20030149606 | Cragun et al. | Aug 2003 | A1 |
20030154293 | Zmolek | Aug 2003 | A1 |
20030163537 | Rohall et al. | Aug 2003 | A1 |
20040054726 | Doss et al. | Mar 2004 | A1 |
20040128181 | Zurko et al. | Jul 2004 | A1 |
20040168133 | Wynn et al. | Aug 2004 | A1 |
20040192857 | Borer et al. | Sep 2004 | A1 |
20040199663 | Horvitz et al. | Oct 2004 | A1 |
20040254998 | Horvitz | Dec 2004 | A1 |
20050069099 | Kozdon et al. | Mar 2005 | A1 |
20050125246 | Muller et al. | Jun 2005 | A1 |
20050165631 | Horvitz | Jul 2005 | A1 |
20050171818 | McLaughlin | Aug 2005 | A1 |
20050192857 | Levine | Sep 2005 | A1 |
20050198144 | Kraenzel et al. | Sep 2005 | A1 |
20060004843 | Tafoya et al. | Jan 2006 | A1 |
20060020889 | Coppinger et al. | Jan 2006 | A1 |
20060031326 | Ovenden | Feb 2006 | A1 |
20060031470 | Chen et al. | Feb 2006 | A1 |
20060047557 | Bieselin et al. | Mar 2006 | A1 |
20060069686 | Beyda et al. | Mar 2006 | A1 |
20060184584 | Dunn et al. | Aug 2006 | A1 |
20060190485 | Adams et al. | Aug 2006 | A1 |
20060212330 | Savilampi | Sep 2006 | A1 |
20060242109 | Pereira et al. | Oct 2006 | A1 |
20070016878 | Forlenza et al. | Jan 2007 | A1 |
20070118415 | Chen et al. | May 2007 | A1 |
20070174104 | O'Sullivan et al. | Jul 2007 | A1 |
20080005685 | Drews et al. | Jan 2008 | A1 |
20080034425 | Overcash et al. | Feb 2008 | A1 |
20080037733 | Chen et al. | Feb 2008 | A1 |
Number | Date | Country |
---|---|---|
1014286 | Jun 2000 | EP |
1 560 138 | Aug 2005 | EP |
WO 2005010715 | Feb 2005 | WO |
Entry |
---|
http://en.wikipedia.org/wiki/Microsoft—Outlook; printed Mar. 14, 2006; 4 pages. |
http://www.bcentral.co.uk/products/microsoft-outlook.mspx; printed Mar. 14, 2006; 2 pages. |
Chapters 4, 5 and 7 from Microsoft® Office Outlook® 2003; “Step by Step”; Online Training Solutions, Inc. |
Step-By-Step Manual, Microsoft Outlook, Online Training Solutions, Inc. (2004). |
http://www.effectivemeetings.com (SMART Technologies, Inc., May 2003). |
“Avaya™ Unified Communication Center (UCC) Speech Access Solution”, Avaya, Inc. (2002), 4 pages. |
“Avaya by Example; Three-Week Wonder: Avaya Unified Communication Center Speech Access Gives Road Warriors 15 Additional Days Each Year”, Avaya, Inc. (2005) 3 pages. |
Arthur M. Rosenberg and David A. Zimmer, “Migrating to Enterprise-Wide Communications: The Branch Office Dilemma”, May 2003, 14 pages. |
Arthur M. Rosenberg and David A. Zimmer, “Beyond VoIP: Enterprise Perspectives on Migrating to Multi-Modal Communications and Wireless Mobility”, (Oct. 2004) 38 pages. |
AIM Presence Services, http://developer.aim.com/presenceMain.jsp (2006) 2 pages. |
AIM Bots, http://developer.aim.com/botMain.jsp (2006) 2 pages. |
AIM Buddy Info, http://buddyinfo.aim.com/ (2006) 2 pages. |
Ivtta Turin 98, “The Linguistic Components of the Reward Dialogue Creation Environment and Run Time System”, http://cpk.auc.dk/˜tb/articles/ivtta98.htm (Sep. 1998) 13 pages. |
Rob Kassel, “How Speech Recognition Works”, http://www.microsoft.com/speech/docs/How—Speech—Works—Article.htm (Nov. 30, 2004) 4 pages. |
“How to Use a TTY”, NETAC Teacher Tipsheet, htt://72.14.203.104/search?q=cache:JdktLkxPgMUJ:www.netac.rit.edu/downloads/TPSHT—TTY.pdf+%22teletypewriter%22+. . . (1999) 4 pages. |
“TTY Brochure Feb. 2006”, http://72.14.203.104/search?q=cache:O3tW0eQtbTEF: ods.utk.edu/brochures/TTYBrochureFebruary2006.pdf+%22teletypewrite . . . (Feb. 2006) 3 pages. |
Tony Vitale, “Hardware and Software Aspects of a Speech Synthesizer Developed for Persons With Disabilities”, http://codi.buffalo.edu/archives/computing/.dec.speech (1993). |
Dave Anderson and George McNeill, “Artificial Neural Networks Technology”, http://www.dacs.dtic.mil/techs/dacs—reports/text/neural—nets.txt (Aug. 20, 1992) 145 pages. |
U.S. Appl. No. 10/770,640, filed Feb. 2, 2004, Mohler |
U.S. Appl. No. 11/350,050, filed Feb. 7, 2006, Atkins et al. |
U.S. Appl. No. 11/488,487, filed Jul. 17, 2006, Daily et al. |
U.S. Appl. No. 11/554,442, filed Oct. 30, 2006, Atkins et al. |
U.S. Appl. No. 11/554,478, filed Oct. 30, 2006, Atkins et al. |
U.S. Appl. No. 11/554,497, filed Oct. 30, 2006, Chu et al. |
U.S. Appl. No. 11/619,145, filed Jan. 2, 2007, Atkins et al. |
U.S. Appl. No. 11/669,707, filed Jan. 31, 2007, Blair et al. |
“Meetings in America”, MCI Conferencing, available at http://e-meetings.mci.com/meetingsinamerica/uswhitepaper.php3, website updated Aug. 19, 2003, pp. 1-12. |
“WebAccess Client User Guide” Novell GroupWise 6.5, Oct. 31, 2005, 68 pages. |
AIM Acronym Dictionary, http://www.aim.com/acronyms.adp (Jan. 16, 2007) 7 pages. |
Boyce, “Microsoft Office Outlook 2003 Inside Out,” Nov. 5, 2003, Microsoft Press, Chapters 1, 19, 20. |
Dey et al., CybreMinder: A Context-Aware System for Supporting Reminders, Handheld and Ubiquitous Computing: Second International Symposium, HUC 2000, Bristol, UK, Sep. 2000. Proceedings, Jul. 31, 2003, 15 pages, vol. 1927/2000, Springer Berlin/Heidelberg. |
“FreeBusy—Microsoft Outlook email autoresponder” http://freebusy.4team.biz/; printed May 24, 2006; 4 pages. |
Yin “[Design] linking and grouping items”, available at http://lists.osafoundation.org/pipermail/design/2005-August/003159.html Aug. 1, 2005, pp. 1-2. |
Background of the Invention for the above-captioned application (previously provided). |
Avaya Case Study (Advertising Agency Uses Avaya Unified Messenger to Streamline Communications, 2003 Avaya Inc.), 2 pages. |
Avaya Press Release (Avaya Introduces IBM Lotus Domino Version of Its Market-Leading Unified Messaging Software, http://www.avaya.com/usa/Error404.aspx?currentpath=master-usa/en-us/corporate/pressroom/pressreleases/2003/pr-03,Jan. 27, 2003), 4 pages. |
Avaya Unified Messenger Client User Guide (2002 Avaya Inc.) Avaya Web Pages (Retrieved Archive.org from Jun. 13, 2004), 167 pages. |
Avaya Unified Messenger Solution—Microsoft Exange 2000 version Installation Guide (2002 Avaya Inc.) 164 pages. |
U.S. Appl. No. 12/570,933, filed Sep. 30, 2009, Chen et al. |
Avaya Unified Messenger Solution—Microsoft Exange Version, 2000 version (2002 Avaya Inc), 8 pages. |
“Products: Groove Virtual Office,” groove.com, 2005, retrieved Mar. 11, 2011, http://replay.waybackmachine.org/2005041 901 0213/http://www.groove.netiindex.cfm/pagenamelVirtualOffice/, 2 pages. |
“Competitive analysis of collaboration tools,” http://www.hcii.cmu.edu/M-HCI/2004/sun/competition.htm, 2004, retrived Mar. 11, 2011, 6 pages. |
Boyce, “Microsoft Office Outlook 2003 Inside Out,” Nov. 5, 2003, Microsoft Press, Chapter 2. |
Raider, “Make Address Book Smart Groups auto-complete in mail,” MacOsHints.com, contributed Jun. 29, 2005, pp. 1-4. |
Avantgo: AvantGo launches new release of Pylon products; AvantGo Pylon 5.1 offers new support for Domino 6, Palm OS 5 and custom repeating meetings M2 Presswire. Coventry: Jan. 24, 2003. p. 1-4. |
“Special Edition Using Lotus Notes and Domino 5” (Published by Que, Aug. 23, 1999, ISBN 0-7897-1814-6. |
“Windows Client User Guide” (Novell Groupwise 7.0, Mar. 14, 2008, copyright 2005-2008) discloses Groupwise 7.0 (released Aug. 15, 2005), 389 pages. |
Clayton, Brad “Microsoft Outlook 2003 Enhancements”, modified Apr. 19, 2004, Purdue University, 4 pages. |
Number | Date | Country | |
---|---|---|---|
20070265903 A1 | Nov 2007 | US |
Number | Date | Country | |
---|---|---|---|
60799223 | May 2006 | US |