The present disclosure relates to the field of computers, and specifically to messages between computers. Still more particularly, the present disclosure relates to notification messages related to users' presence conditions.
A computer-implemented method, system, and computer program product for managing presence messages for a pre-defined group of e-mail users is presented. An unavailability time period, during which a pre-defined group of e-mail users will be unavailable in the future, is established. A notice, which notifies the pre-defined group of e-mail users that an unavailability control instruction will be sent in the future to participating members of the group of e-mail users, is transmitted to the group of e-mail users. An acceptance signal, identifying the participating members, is received, indicating which members of the group of e-mail users agree to permit the unavailability control instruction to be received and implemented on their participating computers in the future. The unavailability control instruction is then transmitted to the participating computers at an initiation of the unavailability time period, in order to auto-generate an appropriate presence message for the participating members.
As will be appreciated by one skilled in the art, the present disclosure may be embodied as a system, method or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, the present disclosure may take the form of a computer program product embodied in one or more computer-readable medium(s) having computer-readable program code embodied thereon.
Any combination of one or more computer-readable medium(s) may be utilized. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium. A computer-readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer-readable storage medium may be any tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer-readable signal medium may be any computer-readable medium that is not a computer-readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
With reference now to the figures, and in particular to
Computer 102 includes a processor unit 104 that is coupled to a system bus 106. Processor unit 104 may utilize one or more processors, each of which has one or more processor cores. A video adapter 108, which drives/supports a display 110, is also coupled to system bus 106. In one embodiment, a switch 107 couples the video adapter 108 to the system bus 106. Alternatively, the switch 107 may couple the video adapter 108 to the display 110. In either embodiment, the switch 107 is a switch, preferably mechanical, that allows the display 110 to be coupled to the system bus 106, and thus to be functional only upon execution of instructions (e.g., presence status notification leveraging program—PSNLP 148 described below) that support the processes described herein.
System bus 106 is coupled via a bus bridge 112 to an input/output (I/O) bus 114. An I/O interface 116 is coupled to I/O bus 114. I/O interface 116 affords communication with various I/O devices, including a keyboard 118, a mouse 120, a media tray 122 (which may include storage devices such as CD-ROM drives, multi-media interfaces, etc.), a printer 124, and (if a VHDL chip 137 is not utilized in a manner described below), external USB port(s) 126. While the format of the ports connected to I/O interface 116 may be any known to those skilled in the art of computer architecture, in a preferred embodiment some or all of these ports are universal serial bus (USB) ports.
As depicted, computer 102 is able to communicate with a software deploying server 150, status notification server 152, and/or other status message implementing computer(s) 154 via network 128 using a network interface 130. Network 128 may be an external network such as the Internet, or an internal network such as an Ethernet or a virtual private network (VPN).
A hard drive interface 132 is also coupled to system bus 106. Hard drive interface 132 interfaces with a hard drive 134. In a preferred embodiment, hard drive 134 populates a system memory 136, which is also coupled to system bus 106. System memory is defined as a lowest level of volatile memory in computer 102. This volatile memory includes additional higher levels of volatile memory (not shown), including, but not limited to, cache memory, registers and buffers. Data that populates system memory 136 includes computer 102's operating system (OS) 138 and application programs 144.
OS 138 includes a shell 140, for providing transparent user access to resources such as application programs 144. Generally, shell 140 is a program that provides an interpreter and an interface between the user and the operating system. More specifically, shell 140 executes commands that are entered into a command line user interface or from a file. Thus, shell 140, also called a command processor, is generally the highest level of the operating system software hierarchy and serves as a command interpreter. The shell provides a system prompt, interprets commands entered by keyboard, mouse, or other user input media, and sends the interpreted command(s) to the appropriate lower levels of the operating system (e.g., a kernel 142) for processing. Note that while shell 140 is a text-based, line-oriented user interface, the present disclosure will equally well support other user interface modes, such as graphical, voice, gestural, etc.
As depicted, OS 138 also includes kernel 142, which includes lower levels of functionality for OS 138, including providing essential services required by other parts of OS 138 and application programs 144, including memory management, process and task management, disk management, and mouse and keyboard management.
Application programs 144 include a renderer, shown in exemplary manner as a browser 146. Browser 146 includes program modules and instructions enabling a world wide web (WWW) client (i.e., computer 102) to send and receive network messages to the Internet using hypertext transfer protocol (HTTP) messaging, thus enabling communication with software deploying server 150 and other described computer systems.
Application programs 144 in computer 102's system memory (as well as software deploying server 150's system memory) also include a presence status notification leveraging program (PSNLP) 148. PSNLP 148 includes code for implementing the processes described below, including those described in
Also stored in system memory 136 is a VHDL (VHSIC hardware description language) program 139. VHDL is an exemplary design-entry language for field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), and other similar electronic devices. In one embodiment, execution of instructions from PSNLP 148 causes VHDL program 139 to configure VHDL chip 137, which may be an FPGA, ASIC, etc.
In another embodiment of the present disclosure, execution of instructions from PSNLP 148 results in a utilization of VHDL program 139 to program a VHDL emulation chip 151. VHDL emulation chip 151 may incorporate a similar architecture as described above for VHDL chip 137. Once PSNLP 148 and VHDL program 139 program VHDL emulation chip 151, VHDL emulation chip 151 performs, as hardware, some or all functions described by one or more executions of some or all of the instructions found in PSNLP 148. That is, the VHDL emulation chip 151 is a hardware emulation of some or all of the software instructions found in PSNLP 148. In one embodiment, VHDL emulation chip 151 is a programmable read only memory (PROM) that, once burned in accordance with instructions from PSNLP 148 and VHDL program 139, is permanently transformed into a new circuitry that performs the functions needed to perform the process described below in
The hardware elements depicted in computer 102 are not intended to be exhaustive, but rather are representative to highlight essential components required by the present disclosure. For instance, computer 102 may include alternate memory storage devices such as magnetic cassettes, digital versatile disks (DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present disclosure.
With reference now to
In addition to the presence instruction 222 auto-generating OOO messages, a group unavailability message 216 can also result from the presence instruction request 204 to the presence notification server 206. For example, assume that an e-mail transmitting computer 212 sends an e-mail to one of the participating computers (e.g., 208a-n). If a single user of that one participating computer is OOO, then the group unavailability message 216 will not only let the e-mail transmitting computer 212 know that single user is unavailable, but will also let it know which other users of other participating computers are unavailable (OOO).
In order to understand what a “participating computer” is, refer now to
With reference now to
Note that the process described above is server-based, in which the presence notification server 206 orchestrates the operations. In another embodiment, the process is client-based. For example, if presence instruction receiving computer 208a receives an e-mail or chat window, which contains an upcoming OOO notice, then computer 208a can automatically transmit that same upcoming OOO notice to presence instruction receiving computer 208b, since the users of 208a and 208b are both in a same group to which the OOO notice applies. This automatic forwarding of the OOO notice is thus transparent to the user of 208a.
Referring now to
With reference to block 508, in one embodiment instructions are then transmitted, from the presence server to user clients, causing a schedule calendar for all of the participating members to be automatically adjusted in conformance with the pre-defined unavailability message. As described in block 510, the unavailability control instruction is then transmitted to the participating computers at an initiation of the unavailability time period. In response to an e-mail being sent to a participating computer during the unavailability time period (query block 512), the unavailability control instruction causes at least one of the participating computers to auto-generate an appropriate presence message (block 514). Note that in one embodiment, the e-mail may be sent to both approving (participating) computers/members of the group, as well as non-approving (non-participating) computers/users. However, the e-mail sent to the participating computers will include embedded logic for causing the participating computer to issue an OOO notice (and to adjust the local schedule calendar), while the version of the e-mail sent to non-participating computers will not include this embedded logic. Thus, a non-participating user will be advised of the impending OOO notice for another user, but will not have this OOO notice auto-generated on her computer. This difference capitalizes on a preferred embodiment of the present disclosure, in which the extensibility of protocols used by simple mail transfer protocol (SMTP) for e-mail, calendaring and scheduling allow the utilization of two cooperating host and destination systems, one for e-mail content and one for auto-generation of OOO notices and their associated calendaring and scheduling. The process ends at terminator block 516.
As described above, in one embodiment of the present disclosure, the e-mail transmitting computer sent the e-mail message to only a first member of the participating members. Nonetheless, the group unavailability message describes an unavailability presence status of all of the participating members.
In one embodiment of the present disclosure, the group unavailability message is associated with a set of user preferences and rules as described above, resulting in the auto-generation of an expanded unavailability message based on the set of user preferences and rules. In one embodiment, this expanded unavailability message provides directions to an e-mail sender for contacting alternate recipients in accordance with skill sets held by the alternate recipients. For example, the expanded unavailability message (OOO) may direct the e-mail sender to call 555-555-5555 if she needs technical support, or to call 555-555-6666 if she needs billing information.
In one embodiment of the present disclosure, when one member of a group agrees to participate in the auto-generation of an OOO or similar type message, this decision is transmitted to all other members of his group. This acceptance message may be amalgamated by the presence server such that it contains a listing of all accepting/participating clients/users. In one embodiment of the present disclosure, a period of time is adjusted between the notice and the transmitting of the unavailability control instruction according to a relationship between two members from the participating members, wherein the relationship is defined in a set of user preferences and rules. For example, assume that User A and User B, from a same group, work closely together. If User A has agreed to be OOO during the company picnic, then he probably doesn't need to let User B know until just before the picnic. However, if User A and User B do not work closely together, then User A would want to give User B more lead time, such that User B will know well in advance that User A will be attending the picnic.
In one embodiment of the present invention, a staffing alert is transmitted to a manager when the number of participating members of the group reaches a pre-determined threshold, and/or when the OOO-causing event (e.g., the picnic) occurs (and thus the presence instruction 222 shown in
In one embodiment of the present invention, the group activity that causes the leveraged OOO-type message to be generated is a known calendar holiday. In another embodiment, the group activity is an out-of-office activity (recreational, work, travel, etc.) of the pre-defined group of e-mail users.
In one embodiment, if it is determined that the group activity temporally conflicts (i.e., two events are scheduled at the same time) with an earlier commitment for the pre-defined group of e-mail users, then the unavailability control instruction is deleted, since the participating users will presumably honor the previous commitment.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. 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 involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the present disclosure. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of various embodiments of the present disclosure has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosure in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the disclosure. The embodiment was chosen and described in order to best explain the principles of the disclosure and the practical application, and to enable others of ordinary skill in the art to understand the disclosure for various embodiments with various modifications as are suited to the particular use contemplated.
Note further that any methods described in the present disclosure may be implemented through the use of a VHDL (VHSIC Hardware Description Language) program and a VHDL chip. VHDL is an exemplary design-entry language for Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), and other similar electronic devices. Thus, any software-implemented method described herein may be emulated by a hardware-based VHDL program, which is then applied to a VHDL chip, such as a FPGA.
Having thus described embodiments of the disclosure of the present application in detail and by reference to illustrative embodiments thereof, it will be apparent that modifications and variations are possible without departing from the scope of the disclosure defined in the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
6057841 | Thurlow et al. | May 2000 | A |
6442589 | Takahashi et al. | Aug 2002 | B1 |
6640230 | Doss et al. | Oct 2003 | B1 |
7406504 | Paul | Jul 2008 | B2 |
7526286 | Allen, Jr. et al. | Apr 2009 | B1 |
7587457 | Fujibayashi | Sep 2009 | B2 |
7599473 | Michael et al. | Oct 2009 | B2 |
7801954 | Cadiz et al. | Sep 2010 | B2 |
7844669 | Mohler | Nov 2010 | B1 |
7865556 | Kadashevich | Jan 2011 | B2 |
7899479 | Zhang | Mar 2011 | B2 |
7945612 | Raghav et al. | May 2011 | B2 |
7984105 | Griffin | Jul 2011 | B2 |
20020090069 | Yaker | Jul 2002 | A1 |
20020131565 | Scheuring et al. | Sep 2002 | A1 |
20020152272 | Yairi | Oct 2002 | A1 |
20020165749 | Northcutt et al. | Nov 2002 | A1 |
20030120733 | Forman | Jun 2003 | A1 |
20040003030 | Abe | Jan 2004 | A1 |
20050047562 | Holz et al. | Mar 2005 | A1 |
20050076090 | Thuerk | Apr 2005 | A1 |
20050102368 | Forman et al. | May 2005 | A1 |
20050164151 | Klein | Jul 2005 | A1 |
20060069580 | Mason et al. | Mar 2006 | A1 |
20060075038 | Mason et al. | Apr 2006 | A1 |
20060168045 | Pickover | Jul 2006 | A1 |
20060168062 | Hebert et al. | Jul 2006 | A1 |
20060195363 | Heron et al. | Aug 2006 | A1 |
20060212330 | Savilampi | Sep 2006 | A1 |
20070081640 | Jachner | Apr 2007 | A1 |
20070192419 | Vuong et al. | Aug 2007 | A1 |
20070291911 | Visser | Dec 2007 | A1 |
20080002820 | Shtiegman et al. | Jan 2008 | A1 |
20080040177 | Vuong et al. | Feb 2008 | A1 |
20080059493 | Blohm | Mar 2008 | A1 |
20080065755 | Caspi et al. | Mar 2008 | A1 |
20080104177 | Keohane et al. | May 2008 | A1 |
20080120386 | Piccinini et al. | May 2008 | A1 |
20080127204 | Dai et al. | May 2008 | A1 |
20080133302 | Brauninger et al. | Jun 2008 | A1 |
20080133708 | Alvarado et al. | Jun 2008 | A1 |
20080140665 | Ariel et al. | Jun 2008 | A1 |
20080155026 | Daniels-Farrar et al. | Jun 2008 | A1 |
20080177850 | Piccinini et al. | Jul 2008 | A1 |
20080183814 | Sanghavi | Jul 2008 | A1 |
20080263162 | Staiman et al. | Oct 2008 | A1 |
20080294482 | Bank et al. | Nov 2008 | A1 |
20090006557 | Florkey et al. | Jan 2009 | A1 |
20090010400 | Amin | Jan 2009 | A1 |
20090077183 | Bruce et al. | Mar 2009 | A1 |
20090113001 | Manning et al. | Apr 2009 | A1 |
20090150500 | Kumar et al. | Jun 2009 | A1 |
20090198783 | Bloomer et al. | Aug 2009 | A1 |
20090228806 | Kadashevich et al. | Sep 2009 | A1 |
20090259718 | O'Sullivan et al. | Oct 2009 | A1 |
20090307323 | Kato et al. | Dec 2009 | A1 |
20100105359 | Bocking et al. | Apr 2010 | A1 |
20100146059 | Dellafera et al. | Jun 2010 | A1 |
20100169429 | O'Sullivan et al. | Jul 2010 | A1 |
20100198921 | Choi et al. | Aug 2010 | A1 |
20100250682 | Goldberg et al. | Sep 2010 | A1 |
20100318615 | Griffin | Dec 2010 | A1 |
20110004503 | Farrell et al. | Jan 2011 | A1 |
20110010447 | Fox et al. | Jan 2011 | A1 |
20110047558 | Agulnik et al. | Feb 2011 | A1 |
20110087742 | Deluca et al. | Apr 2011 | A1 |
20110137992 | Michel et al. | Jun 2011 | A1 |
20110161434 | Farrell et al. | Jun 2011 | A1 |
20110185006 | Raghav et al. | Jul 2011 | A1 |
Number | Date | Country | |
---|---|---|---|
20110161434 A1 | Jun 2011 | US |