Calendar repair is a process for verifying the accuracy of important meeting properties. In some situations, calendars contain appointments (meetings) that may be organized by one person, the Organizer. The same meeting may be represented as multiple independent items stored in many different calendars of all attendees of the meeting. The Organizer, attendees, and calendar applications may change these independent items during the lifetime of the meeting, making them inconsistent between what the Organizer has on the calendar and what attendees may have on their calendar. This often causes problems because, if the meeting gets out-of sync between the organizer and attendees, it may cause attendees to miss the meeting. The conventional strategy is to rely on attendee users to keep their own meeting appointments in-sync and up to date, but these users may not always be able to identify discrepancies.
Calendar repair may be provided. This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter. Nor is this Summary intended to be used to limit the claimed subject matter's scope.
Calendar repair may be provided. Calendar events, such as appointments and meetings, may be created and copied to a plurality of attendee calendars. A first copy of the event may be compared to a second copy of the event, and an event property of the second event may be updated to match a corresponding event property of the first event.
Both the foregoing general description and the following detailed description provide examples and are explanatory only. Accordingly, the foregoing general description and the following detailed description should not be considered to be restrictive. Further, features or variations may be provided in addition to those set forth herein. For example, embodiments may be directed to various feature combinations and sub-combinations described in the detailed description.
The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate various embodiments of the present invention. In the drawings:
The following detailed description refers to the accompanying drawings. Wherever possible, the same reference numbers are used in the drawings and the following description to refer to the same or similar elements. While embodiments of the invention may be described, modifications, adaptations, and other implementations are possible. For example, substitutions, additions, or modifications may be made to the elements illustrated in the drawings, and the methods described herein may be modified by substituting, reordering, or adding stages to the disclosed methods. Accordingly, the following detailed description does not limit the invention. Instead, the proper scope of the invention is defined by the appended claims.
Calendar repair may be provided. Consistent with embodiments of the present invention, corresponding calendar items of organizers and attendees may be compared on a regular basis. A calendar server, such as Microsoft® Exchange®, produced and sold by Microsoft® Corporation of Redmond, Wash., may verify that important properties such as time, date, and/or attendee response status match as inconsistencies in such properties may result in an attendee missing the meeting. The verification may be done by applying additional business logic to allow certain flexibility in discrepancies and allow attendees to still have enough flexibility to edit their meeting item. If the discrepancy violates the business logic (e.g., the inconsistency of the properties will lead to a missed meeting), the server may perform the appropriated corrective actions, such as changing properties on an attendee's appointment to match the organizer's version of the appointment.
After creating the event in stage 210, method 200 may advance to stage 215 where computing device 500 may replicate the event properties to other calendars. For example, the event associated with the user of organizer computer 120 may be copied to a shared calendar on server 110 and/or a calendar application executing on at least one of plurality of attendee computers 130, 140, and 150.
From stage 215, method 200 may advance to stage 220 where computing device 500 may determine whether a property associated with a first copy of the event differs from a corresponding property associated with a second copy of the event. For example, the organizer's copy of the event may be compared to one and/or more of the attendees' copies of the event to determine whether any of the properties differ. Consistent with embodiments of the invention, this comparison may be performed on a periodic basis, such as once every 24 hours and/or during a low server load time. For example, server 110 (and/or an administrator thereof) may select a time when few other server processes are executing to perform event comparisons. The comparison may also be performed manually, such as by an administrator executing an application associated with performing method 200 on server 110.
If no differences are found at stage 220, method 200 may end at stage 245. Otherwise, method 200 may advance to stage 225 where computing device 500 may determine whether the differing information is critical. Critical information may comprise, for example, those event properties that may cause the user associated with the out-of-sync information to miss some and/or all of the meeting and/or to attempt to attend a meeting that has been canceled or rescheduled. For example, server 110 may compare the organizer's copy of the event to an event associated with a user of attendee computer 130 and determine that the organizer's copy has a start time of 9:00 while the attendee's copy has a start time of 9:30. Since the attendee would not have the correct start time, they may miss the meeting, and this difference may be considered critical.
Other critical properties may comprise, for example, an event's existence, an event's location, an event request acceptance, a duplicate property, a duplicate event, and a corruption. For example, the event may be missing entirely from the attendee's calendar and/or may have been corrupted and become unreadable by attendee computer 130, 140, or 150. Similarly, duplicate properties and/or an out-of-sync acceptance of the meeting request (e.g., the attendee accepted the meeting request, but that acceptance may not have been relayed to the organizer) may cause a calendar application and/or other applications, such as a server-based reminder service, that interact with the attendee user's calendar to miss and/or misstime a reminder.
If, at stage 225, computing device 500 determines that the differing event property is critical, method 200 may advance to stage 235 where computing device 500 may update the event property. For example, server 110 may copy the starting time from the organizer's copy of the event to the attendee's copy of the event. The organizer's copy of the event may be considered to be the master copy of the event properties, and may override the properties of the attendees' events. For another example, server 110 may determine that an event is still present on an attendee's calendar, but has been removed from an organizer's calendar. Server 110 may delete the item from the attendee's calendar, and place a copy of the event in a deleted items log and/or folder for review and/or recovery by the attendee.
Consistent with embodiments of the invention, other methods may be used to resolve differences, such as keeping a master copy of the event on the server, separate from the calendars of the attendees and/or organizer, or using a most recently updated event property as the correct value. Computing device 500 may also compare the copies of the event for the organizer and all of the attendees to determine whether a majority or plurality of the events agree on the out-of-sync property, and use the agreed on value to update the out-of-sync property.
After computing device 500 updates the event information in stage 235, method 200 may proceed to stage 240 where computing device 500 may notify the user of the update. For example, server 110, organizer computer 120, and/or attendee computers 130, 140, and 150 may display a visual notification on a screen, provide an audio alert, and/or send an e-mail or Short Message Service (SMS) message. Once computing device 500 notifies the user in stage 235, method 200 may then end at stage 245.
If, at stage 225, computing device 500 determines that the differing information is not critical, method 200 may advance to stage 230 where computing device 500 may determine whether the differing information is private. For example, the organizer and/or an attendee may add additional information to their copy of the event, such as a note to remind them to raise a particular issue during a meeting. These notes may differ and/or be absent among some or all of the other event copies, and method 200 may advance to stage 250 where computing device may copy the updated information to the other event copies. After updating the event property, or if the property is marked as private, such as by using a designated private property field and/or setting a private flag for the property, method 200 may end at stage 245.
Consistent with embodiments of the invention, method 200 may be invoked by server 110 to compare the events of first calendar 300 with the events of second calendar 350. For example, first meeting 310 may comprise a start time property of 9:30 AM while copy of the first meeting 360 may comprise a corresponding start time property of 11:30 AM. Since first meeting 310 is associated with the organizer of the event, and the start time property may be considered to be critical to attendance, the start time of 9:30 AM may be used to update copy of the first meeting 360 on second calendar 350. For a second example, method 200 may determine that the user of second calendar 350 accepted a meeting request for lunch meeting 320 and may further determine that the event is missing from second calendar 250. Server 110 may therefore create an event on second calendar 350 corresponding to lunch meeting 320. For another example, server 110 may compare copy of the second meeting 370 with second meeting 330 and determine that the only difference is in the meeting title. This difference may be determined to not be critical, and so the corresponding title properties may be left out-of-sync between the two events. Consistent with embodiments of the invention, the occurrence of the comparison and determination may be recorded in a log associated with the event. Server 110 may refer to the log on a later comparison of the two events, and may consequently skip over the non-critical information rather than re-compare the properties known to be out-of-sync. An administrator of server 110 may configure a list of event properties considered to be critical, and may update this list at any time. If the list has changed, server 110 may be operative to determine whether any previously determined out-of-sync properties are now considered to be critical, and may update those properties in accordance with method 200.
Method 200 may produce an output file comprising information indicating what updates, if any, may have been made along with identifying information for the event being updated. An output file may be produced for each user and/or each event, such as a file per user, per event, per periodic update. Consistent with embodiments of the invention, a single output file may be used for all logged updates. Each logged update may comprise a plurality of properties, such as a category, an organizer, an attendee (and/or attendees), an indication if the item was repaired due to an issue with the organizer's item or the attendee's item, a start and end time of the meeting, a subject of the meeting, a meeting type (single event, occurrence master, or occurrence instance), and/or a repair action.
If an event includes a group and/or a distribution list (e.g., a single attendee entry associated with a plurality of users), server 110 may be operative to expand the distribution list and compare the organizer's event to a copy of the event on each of the plurality of users' calendars. Consistent with embodiments of the invention, expansion of the group may be limited to a maximum number of users to avoid negatively impacting server performance. This group expansion may be configured by an administrator of server 110.
An embodiment consistent with the invention may comprise a system for providing calendar repair. The system may comprise a memory storage and a processing unit coupled to the memory storage. The processing unit may be operative to create an event associated with a plurality of attendees, copy the event to a plurality of calendars, compare a first copy of the event to a second copy of the event, and update an event property of the second event to match a corresponding event property of the first event. The comparison may be performed on a periodic basis, such as every 24 hours, and/or may occur during a time of low server load.
Another embodiment consistent with the invention may comprise a system for providing calendar repair. The system may comprise a memory storage and a processing unit coupled to the memory storage. The processing unit may be operative to create an event associated with at least one organizer and a plurality of attendees, copy at least one property associated with the event to a plurality of calendars, and determine whether the at least one property associated with the event on at least one of the plurality of calendars is the same as a corresponding property associated with the event associated with the organizer. If the properties are out-of-sync, the processing device may be further operative to update the at least one property to match the corresponding property associated with the organizer's event.
Yet another embodiment consistent with the invention may comprise a system for providing calendar repair. The system may comprise a memory storage and a processing unit coupled to the memory storage. The processing unit may be operative to create an event on a calendar associated with an organizer of the event, replicate information associated with the event to a plurality of attendee calendars, determine, on a periodic basis, whether the information associated with the event on at least one of the attendees' calendars differs from the information associated the organizer's event, determine whether any such difference comprises a property likely to cause the attendee to miss the meeting. The processing unit may be further operative to update the event on the attendee's calendar with the information from the organizer's event and provide a notification to the attendee that the event has been updated. Such notification may comprise, for example, at least one of the following: sending an e-mail message to the user, sending an SMS message to the user, and displaying a notification message on a display device associated with the user. The processing unit may be further operative to determine whether the differing information associated either the attendee's event or the organizer's event comprises a private property, and, if so, leave the information out-of-sync between the attendee event and the organizer's event.
With reference to
Computing device 500 may have additional features or functionality. For example, computing device 500 may also include additional data storage devices (removable and/or non-removable) such as, for example, magnetic disks, optical disks, or tape. Such additional storage is illustrated in
Computing device 500 may also contain a communication connection 516 that may allow device 500 to communicate with other computing devices 518, such as over a network in a distributed computing environment, for example, an intranet or the Internet. Communication connection 516 is one example of communication media. Communication media may typically be embodied by computer readable instructions, data structures, program modules, or other data in a modulated data signal, such as a carrier wave or other transport mechanism, and includes any information delivery media. The term “modulated data signal” may describe a signal that has one or more characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media may include wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency (RF), infrared, and other wireless media. The term computer readable media as used herein may include both storage media and communication media.
As stated above, a number of program modules and data files may be stored in system memory 504, including operating system 505. While executing on processing unit 502, programming modules 506 (e.g. event comparison module 520) may perform processes including, for example, one or more of method 200's stages as described above. The aforementioned process is an example, and processing unit 502 may perform other processes. Other programming modules that may be used in accordance with embodiments of the present invention may include electronic mail and contacts applications, word processing applications, spreadsheet applications, database applications, slide presentation applications, drawing or computer-aided application programs, etc.
Generally, consistent with embodiments of the invention, program modules may include routines, programs, components, data structures, and other types of structures that may perform particular tasks or that may implement particular abstract data types. Moreover, embodiments of the invention may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like. Embodiments of the invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
Furthermore, embodiments of the invention may be practiced in an electrical circuit comprising discrete electronic elements, packaged or integrated electronic chips containing logic gates, a circuit utilizing a microprocessor, or on a single chip containing electronic elements or microprocessors. Embodiments of the invention may also be practiced using other technologies capable of performing logical operations such as, for example, AND, OR, and NOT, including but not limited to mechanical, optical, fluidic, and quantum technologies. In addition, embodiments of the invention may be practiced within a general purpose computer or in any other circuits or systems.
Embodiments of the invention, for example, may be implemented as a computer process (method), a computing system, or as an article of manufacture, such as a computer program product or computer readable media. The computer program product may be a computer storage media readable by a computer system and encoding a computer program of instructions for executing a computer process. The computer program product may also be a propagated signal on a carrier readable by a computing system and encoding a computer program of instructions for executing a computer process. Accordingly, the present invention may be embodied in hardware and/or in software (including firmware, resident software, micro-code, etc.). In other words, embodiments of the present invention may take the form of a computer program product on a computer-usable or computer-readable storage medium having computer-usable or computer-readable program code embodied in the medium for use by or in connection with an instruction execution system. A computer-usable or computer-readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
The computer-usable or computer-readable medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, device, or propagation medium. More specific computer-readable medium examples (a non-exhaustive list), the computer-readable medium may include the following: an electrical connection having one or more wires, a portable computer diskette, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, and a portable compact disc read-only memory (CD-ROM). Note that the computer-usable or computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
Embodiments of the present invention, for example, are described above with reference to block diagrams and/or operational illustrations of methods, systems, and computer program products according to embodiments of the invention. The functions/acts noted in the blocks may occur out of the order as shown in any flowchart. For example, two blocks shown in succession may in fact be executed substantially concurrently or the blocks may sometimes be executed in the reverse order, depending upon the functionality/acts involved.
While certain embodiments of the invention have been described, other embodiments may exist. Furthermore, although embodiments of the present invention have been described as being associated with data stored in memory and other storage mediums, data can also be stored on or read from other types of computer-readable media, such as secondary storage devices, like hard disks, floppy disks, or a CD-ROM, a carrier wave from the Internet, or other forms of RAM or ROM. Further, the disclosed methods' stages may be modified in any manner, including by reordering stages and/or inserting or deleting stages, without departing from the invention.
All rights including copyrights in the code included herein are vested in and the property of the Applicant. The Applicant retains and reserves all rights in the code included herein, and grants permission to reproduce the material only in connection with reproduction of the granted patent and for no other purpose.
While the specification includes examples, the invention's scope is indicated by the following claims. Furthermore, while the specification has been described in language specific to structural features and/or methodological acts, the claims are not limited to the features or acts described above. Rather, the specific features and acts described above are disclosed as example for embodiments of the invention.
This application is a continuation of, and claims priority to, U.S. Non-Provisional application Ser. No. 13/765,644, filed Feb. 12, 2013, now U.S. Pat. No. 9,213,964, which is a continuation of, and claims priority to U.S. Non-Provisional application Ser. No. 12/647,934, filed Dec. 28, 2009, now U.S. Pat. No. 8,375,081, each of which is hereby incorporated by reference in their entirety. Related U.S. patent application Ser. No. 12/647,944, filed Dec. 28, 2009, now U.S. Pat. No. 8,612,535, entitled “Repairing Calendars with Standard Meeting Messages,” which is assigned to the assignee of the present application, and incorporated by reference. Related U.S. patent application Ser. No. 12/647,962, filed Dec. 28, 2009, now U.S. Pat. No. 8,392,365, entitled “Identifying Corrupted Data on Calendars with Client Intent,” which is assigned to the assignee of the present application, and incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5093901 | Cree | Mar 1992 | A |
5774867 | Fitzpatrick et al. | Jun 1998 | A |
5960406 | Rasansky | Sep 1999 | A |
6064977 | Haverstock | May 2000 | A |
6295541 | Bodnar | Sep 2001 | B1 |
6369840 | Barnett | Apr 2002 | B1 |
6480830 | Ford | Nov 2002 | B1 |
6604079 | Ruvolo | Aug 2003 | B1 |
6640230 | Alexander | Oct 2003 | B1 |
6781920 | Bates et al. | Aug 2004 | B2 |
6988128 | Alexander | Jan 2006 | B1 |
7039596 | Lu | May 2006 | B1 |
7174517 | Barnett | Feb 2007 | B2 |
7318040 | Doss | Jan 2008 | B2 |
7334000 | Chhatrapati | Feb 2008 | B2 |
7370282 | Cary | May 2008 | B2 |
7383291 | Guiheneuf | Jun 2008 | B2 |
7383308 | Groves | Jun 2008 | B1 |
7487234 | Doss | Feb 2009 | B2 |
7584114 | Estrada | Sep 2009 | B2 |
7584412 | Raff | Sep 2009 | B1 |
7599990 | Groves | Oct 2009 | B1 |
7644125 | Baynes et al. | Jan 2010 | B2 |
7668775 | Lu | Feb 2010 | B2 |
7689698 | Hullot | Mar 2010 | B2 |
7792790 | Kim | Sep 2010 | B2 |
7814055 | Hullot | Oct 2010 | B2 |
7822713 | Hullot | Oct 2010 | B2 |
7827240 | Atkins | Nov 2010 | B1 |
7840543 | Guiheneuf | Nov 2010 | B2 |
7870215 | Groves | Jan 2011 | B1 |
7873646 | Yach | Jan 2011 | B2 |
7917127 | Mousseau | Mar 2011 | B2 |
7991636 | Groves | Aug 2011 | B1 |
7991637 | Guiheneuf | Aug 2011 | B1 |
8019863 | Jeide et al. | Sep 2011 | B2 |
8041594 | Wilbrink | Oct 2011 | B2 |
8041725 | Grant | Oct 2011 | B2 |
8074175 | Brush | Dec 2011 | B2 |
8108436 | Chhatrapati | Jan 2012 | B2 |
8121880 | O'Sullivan | Feb 2012 | B2 |
8209613 | Zinn | Jun 2012 | B2 |
8352303 | Lehmann | Jan 2013 | B2 |
8359540 | Darling | Jan 2013 | B2 |
8375081 | Feliberti et al. | Feb 2013 | B2 |
8612535 | Mendes et al. | Feb 2013 | B2 |
8392365 | Feliberti et al. | Mar 2013 | B2 |
8417782 | Tendjoukian | Apr 2013 | B2 |
8612876 | Barnett | Dec 2013 | B2 |
8671009 | Coley | Mar 2014 | B1 |
9053466 | Caceres | Jun 2015 | B2 |
9213964 | Feliberti et al. | Dec 2015 | B2 |
9552571 | Jain | Jan 2017 | B2 |
20020154178 | Barnett | Oct 2002 | A1 |
20030050982 | Chang | Mar 2003 | A1 |
20030131023 | Bassett | Jul 2003 | A1 |
20030154116 | Lofton | Aug 2003 | A1 |
20040064567 | Doss | Apr 2004 | A1 |
20040073615 | Darling | Apr 2004 | A1 |
20040203644 | Anders | Oct 2004 | A1 |
20040225966 | Besharat | Nov 2004 | A1 |
20040243547 | Chhatrapati | Dec 2004 | A1 |
20050102317 | Kamarei | May 2005 | A1 |
20050149726 | Joshi et al. | Jul 2005 | A1 |
20050187896 | Mousseau | Aug 2005 | A1 |
20050198085 | Blakey et al. | Sep 2005 | A1 |
20050216842 | Keohane et al. | Sep 2005 | A1 |
20050262164 | Guiheneuf | Nov 2005 | A1 |
20060007785 | Fernandez | Jan 2006 | A1 |
20060190313 | Lu | Aug 2006 | A1 |
20060212330 | Savilampi | Sep 2006 | A1 |
20070016646 | Tendjoukian | Jan 2007 | A1 |
20070079260 | Bhogal et al. | Apr 2007 | A1 |
20070129986 | Barnett | Jun 2007 | A1 |
20070162517 | Teegan et al. | Jul 2007 | A1 |
20070168892 | Brush | Jul 2007 | A1 |
20070260989 | Vakil | Nov 2007 | A1 |
20080033957 | Forstall | Feb 2008 | A1 |
20080046437 | Wood | Feb 2008 | A1 |
20080046471 | Moore et al. | Feb 2008 | A1 |
20080120158 | Xiao | May 2008 | A1 |
20080134041 | Zinn | Jun 2008 | A1 |
20080140488 | Oral et al. | Jun 2008 | A1 |
20080189159 | Jain | Aug 2008 | A1 |
20080191896 | Jain | Aug 2008 | A1 |
20080195619 | Jain | Aug 2008 | A1 |
20080215691 | Chhatrapati | Sep 2008 | A1 |
20080235681 | Barnett | Sep 2008 | A1 |
20080243948 | Guiheneuf | Oct 2008 | A1 |
20080250334 | Price | Oct 2008 | A1 |
20080307323 | Coffman | Dec 2008 | A1 |
20080313005 | Nessland | Dec 2008 | A1 |
20090019050 | Baron et al. | Jan 2009 | A1 |
20090040875 | Buzescu et al. | Feb 2009 | A1 |
20090112986 | Caceres | Apr 2009 | A1 |
20090150812 | Baker et al. | Jun 2009 | A1 |
20090152349 | Bonev | Jun 2009 | A1 |
20090157414 | O'Sullivan et al. | Jun 2009 | A1 |
20090157693 | Palahnuk | Jun 2009 | A1 |
20090158173 | Palahnuk | Jun 2009 | A1 |
20090196123 | Gautam | Aug 2009 | A1 |
20090201768 | Adams | Aug 2009 | A1 |
20090248480 | Miksovsky | Oct 2009 | A1 |
20090313299 | Bonev | Dec 2009 | A1 |
20100042733 | Jeffrey | Feb 2010 | A1 |
20100122190 | Lu | May 2010 | A1 |
20100174679 | Baynes et al. | Jul 2010 | A1 |
20100214875 | Wilson | Aug 2010 | A1 |
20100214876 | Siegel | Aug 2010 | A1 |
20110093619 | Nelson | Apr 2011 | A1 |
20110106278 | Martin-Cocher et al. | May 2011 | A1 |
20110125545 | Lehmann | May 2011 | A1 |
20110137929 | Lehmann et al. | Jun 2011 | A1 |
20110153629 | Lehmann et al. | Jun 2011 | A1 |
20110307816 | Barnett | Dec 2011 | A9 |
Entry |
---|
“Introducing BusyCal”; accessed on Oct. 28, 2009 at http://www.busymac.com/; 2 pgs. |
Desruisseaux, B., et al.; “Calendaring Extensions to WebDAV (CalDAV)”The Internet Society; Feb. 21, 2006; 82 pgs. |
Dusseault, L., et al.; “Open Calendar Sharing and Scheduling with CalDAV”; Standards Track, IEEE Internet Computing, IEEE Computer Society; Mar./Apr. 2005; pp. 81-89. |
Microsoft TechNet; “Understanding Calendar Repair”; Sep. 9, 2009; accessed on Nov. 13, 2009 at http://technet.microsoft.com/en-us/library/dd298100(EXCHG.140).aspx; 2 pgs. |
Microsoft TechNet; “Understanding Calendar Repair”; Microsoft Corporation; Sep. 9, 2009; accessed on Nov. 9, 2009 at http://technet.microsoft.comien-ushribraiy/dd298100.aspx; 2 pgs. |
Notice of Allowance/Allowability in U.S. Appl. No. 12/647,934 dated Jun. 8, 2012, 15 pages. |
Notice of Allowance/Allowability in U.S. Appl. No. 12/647,934 dated Oct. 22, 2012, 8 pages. |
Notice of Allowance/Allowability in U.S. Appl. No. 12/647,962 dated Sep. 19, 2012, 18 pages. |
Oracle; “Oracle® Calendar Administrator's Guide”; 10g Release 1 (10.1.1); Oct. 2005; 170 pgs. |
Sun Microsystems; “Sun Java™ System Calendar Server 6.3” (White Paper); Apr. 2007; 40 pgs. |
U.S. Non-Final Office Action dated Apr. 19, 2013 in U.S. Appl. No. 12/647,944, 18 pages. |
U.S. Non-Final Office Action dated Nov. 27, 2013 in U.S. Appl. No. 13/765,644, 30 pages. |
U.S. Notice of Allowance dated Aug. 14, 2013 in U.S. Appl. No. 12/647,944, 13 pages. |
U.S. Official Action in U.S. Appl. No. 12/647,934 dated Jul. 16, 2012, 7 pages. |
U.S. Official Action in U.S. Appl. No. 12/647,934 dated Dec. 27, 2011, 27 pages. |
U.S. Official Action in U.S. Appl. No. 12/647,944 dated Jun. 12, 2012, 24 pages. |
U.S. Official Action in U.S. Appl. No. 12/647,944 dated Dec. 22, 2011, 27 pages. |
U.S. Official Action in U.S. Appl. No. 12/647,962 dated Mar. 6, 2012, 30 pages. |
U.S. Appl. No. 13/765,644, Notice of Allowance dated Jan. 7, 2015, 6 pages. |
U.S. Appl. No. 13/765,644, Notice of Allowance dated Apr. 23, 2015, 6 pages. |
U.S. Appl. No. 13/765,644, Notice of Allowance dated Aug. 7, 2015, 6 pages. |
U.S. Appl. No. 13/765,644, Office Action dated May 27, 2014, 11 pages. |
U.S. Appl. No. 13/765,644, Office Action dated Aug. 20, 2014, 10 pages. |
Number | Date | Country | |
---|---|---|---|
20160078412 A1 | Mar 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13765644 | Feb 2013 | US |
Child | 14948973 | US | |
Parent | 12647934 | Dec 2009 | US |
Child | 13765644 | US |