Abstract: A system and method for selecting calendar events based on examining the content of a user's recent e-mail activity. According to an embodiment of the present invention, a scheduling manager assembles a keyword list, wherein the keyword list includes a collection of keywords with associated weights for each keyword among the collection of keywords. If the scheduling manager detects at least two conflicting calendar events scheduled within a calendar program, the scheduling manager searches the at least two conflicting calendar events for at least one keyword on the keyword list. The scheduling manager computes a keyword weight score for each of the at least two conflicting calendar events. If one calendar event among the at least two conflicting calendar events has a highest keyword weight score, the scheduling manager schedules the one calendar event within the calendar program.

Abstract: A method for providing an alert when a potentially or likely malicious web site is browsed to by a user. The method maintains web site identification details. If a web site purporting to be a known, previously identified, encountered and utilized web site is browsed to and requests information, the user is alerted to the precise differences between the stored web site historical identity and the identity of the present requester.

Abstract: Provided are techniques for to enable a virtual input/output server (VIOS) to establish cryptographically secure signals with target LPARs to detect an imposter or spoofing LPAR. The secure signal, or “heartbeat,” may be configured as an Internet Key Exchange/Internet Protocol Security (IKE/IPSec) encapsulated packet (ESP) connection or tunnel. Within the tunnel, the VIOS pings each target LPAR and, if a heartbeat is interrupted, the VIOS makes a determination as to whether the tunnel is broken, the corresponding LPAR is down or a media access control (MAC) spoofing attach is occurring. The determination is made by sending a heartbeat that is designed to fail unless the heartbeat is received by a spoofing device.

Abstract: Mechanisms for providing visual keyboard guides according to a programmable set of keys are provided. With the mechanisms of the illustrative embodiments, a user may select for which keys of a keyboard the user wishes to receive visual guides on a display of a data processing device associated with the keyboard. Thereafter, when the user's fingers are in proximity to keys of the keyboard, a comparison of the keys in proximity to the user's instrument to the keys for which visual guides are to be provided is made. If the keys in proximity to the user's instrument match keys for which visual guides are to be provided, a visual guide is displayed on the display of the data processing device. A graphical user interface may be provided to the user for setting which keys are to have associated visual guides.

Abstract: Disclosed is a method for customizing online calendar entries. A contact list for an online calendar is created including individuals and groups. An exception list is created from the individuals and/or groups on the contact list. When an online invitation is created, but not yet sent, conflict resolution tools allow the creator of the invitation to check all invitee's calendar entries for potential conflicts. A conflict resolution tool checks the calendar of an invitee for potential availability of a time corresponding to an open time slot. A conflict resolution tool responds to the online invitation with an acceptance response. A user can customize the acceptance response. The customized acceptance response is linked to the exception list. If a subsequent online invitation is received from an individual or group member on the exception list during the blocked time slot, the blocked time slot is detected as open, and scheduling of events during the blocked time slot is allowed.

Abstract: A method for providing an alert when a potentially or likely malicious web site is browsed to by a user. The method maintains web site identification details. If a web site purporting to be a known, previously identified, encountered and utilized web site is browsed to and requests information, the user is alerted to the precise differences between the stored web site historical identity and the identity of the present requester.

Abstract: A method of tying related process threads within non-related applications together in terms of memory paging behavior. In a data processing system, a first process thread is related to one or more “partner” threads within separate high latency storage locations. The kernel analyzes the memory “page-in” patterns of multiple threads and identifies one or more partner threads of the first thread based on user input, observed memory page-in patterns, and/or pre-defined identification information within the thread data structures. The kernel marks the first thread and its corresponding related partner threads with a unique thread identifier. When the first thread is subsequently paged into a lower latency memory, the kernel also pages-in the related partner threads that are marked with the unique thread identifier in lockstep. Tying related threads from non-related applications together in terms of memory paging behavior thus eliminates memory management delays.

Abstract: A system and method for presenting individual slides of a presentation on one composite slide wherein the composite slide may be integrated within the presentation. Each individual slide is represented as a thumbnail view on the composite slide and is capable of launching the full version of the presentation by directly linking to the individual slide represented by the thumbnail. The system and method eliminates the need to scroll through each slide of the presentation to find a slide of interest. The system and method also allows the presentation slides to be rearranged or grouped in the composite slide without affecting the order of the individual slide in the presentation.

Abstract: Tracing of the interaction of third party processes on resources used by a program under trace is performed. A viral tag is associated with the program under trace. When the program “touches” a portion of memory, the memory manager associates the viral tag with the memory locations in this portion of memory. When subsequent processes “touch” the tagged memory locations, they acquire the viral tag and then spread it to other memory locations that these subsequent processes touch. The viral tag may be slightly modified so as to identify it as being based on the original viral tag but having been acquired by another process. Each time the viral tag is spread to another program, the viral tag may be slightly modified to indicate that the viral tag is now associated with another entity although is still associated with the original viral tag.

Abstract: Resource utilization information for accessing a file is stored in metadata associated with the file. In response to a command to access the file, the resource utilization information is compared to pre-established warning criteria to determine if the resource utilization for accessing the file meets the criteria for generating a warning. Based on the results of the comparison, a warning message may be output, prior to accessing the file, if results of the comparison indicate that one or more warning criteria are met. The warning message may provide a provide a prompt for a user to determine if he/she still wishes to access the file and if so, the file is accessed; otherwise the operation for accessing the file is terminated prior to the file being accessed.

Abstract: A cellular telephone system, including: a first cellular telephone for a child; a second cellular telephone for a first relative of the child; and at least a third cellular telephone for at least a second relative of the child; the first cellular telephone including a single button that, when the single button is pushed, automatically activates only one call to a closest one of either (a) the second cellular telephone or (b) a closest one of the at least a third cellular telephone; where closest is measured by at least one of closest geographically, closest by driving time, and closest by driving distance.

Abstract: A battery conservation component synchronizes with a user's schedule or calendar. The battery conservation component may disable functions or features to ensure that the device has sufficient battery life for selected calendar events. The battery conservation component may warn the user if a battery charge is necessary to make selected calendar events. The battery conservation component may be applied to a wide variety of portable devices with time-sensitive events. For example, the battery conservation component may be applied to a device with vehicle navigation and estimate time-sensitive events based on waypoints in the vehicle's route. The battery conservation component may synchronize with a user's travel itinerary. Alternatively, the battery conservation component may suggest alternative functions or features based on a time-sensitive event, such as suggesting a shorter movie on a flight or road trip.

Abstract: The ideal client-server for a collaborative application in a client-server network environment is dynamically determined. An Ideal Server utility compares the capabilities of the computer system of an entering client with the computer system of the current client-server to determine which system is best equipped to control the execution of the application. Whenever a new client enters/participates in the application session, the Ideal Server utility evaluates the system capabilities of the new client (the candidate client-server) and compares the new client's system capabilities with the system capabilities of the current client-server. If the new client possesses better capabilities than the current client-server, the new client is provided the role of the client-server. A transfer of the application to the candidate client-server is initiated. Once the transfer is completed, the application resumes processing on the new client-server.

Abstract: Backing up a database, including providing, in the database by a DBMS, at least one record with at least one backup field, the backup field being a data element that controls the backing up of the record, and backing up, by a backup module, the a record in dependence upon a value of the backup field.

Abstract: A cellular telephone system that is part of a call network, includes: a first, second, and at least a third cellular telephones; the first cellular telephone including a first button for activating a call to the second telephone and at least a second button for activating a call to the at least third telephone, the first telephone further including green and red color coding of each of the first button and at least the second button such that a closest one of either (a) the second telephone, or (b) a closest one of the at least a third telephone, will have a button indicated by green coding and other button(s) by red; and where the first telephone can query the call network for the location of said closest cellular telephone, closest measured by at least one of geographically, by driving time, and by driving distance.

Abstract: A method, system and computer-readable medium for generating, caching and transmitting textual equivalents of information contained in an audio signal are presented. The method includes generating a textual equivalent of at least a portion of a speech-based audio signal in one device into a textual equivalent, storing a portion of the textual equivalent in first device's memory and transmitting the stored textual equivalent to a another device.

Abstract: A system and method for selecting calendar events based on examining the content of a user's recent e-mail activity. According to an embodiment of the present invention, a scheduling manager assembles a keyword list, wherein the keyword list includes a collection of keywords with associated weights for each keyword among the collection of keywords. If the scheduling manager detects at least two conflicting calendar events scheduled within a calendar program, the scheduling manager searches the at least two conflicting calendar events for at least one keyword on the keyword list. The scheduling manager computes a keyword weight score for each of the at least two conflicting calendar events. If one calendar event among the at least two conflicting calendar events has a highest keyword weight score, the scheduling manager schedules the one calendar event within the calendar program.

Abstract: A method of tying related process threads within non-related applications together in terms of memory paging behavior. In a data processing system, a first process thread is related to one or more “partner” threads within separate high latency storage locations. The kernel analyzes the memory “page-in” patterns of multiple threads and identifies one or more partner threads of the first thread based on user input, observed memory page-in patterns, and/or pre-defined identification information within the thread data structures. The kernel marks the first thread and its corresponding related partner threads with a unique thread identifier. When the first thread is subsequently paged into a lower latency memory, the kernel also pages-in the related partner threads that are marked with the unique thread identifier in lockstep. Tying related threads from non-related applications together in terms of memory paging behavior thus eliminates memory management delays.

Abstract: An electronic calendar management system for managing a plurality of meeting invitees to limit meeting attendance to a predetermined number of attendees. A meeting planner schedules a meeting using an electronic calendar. A meeting attendee profile (MAP) is defined, comprising parameters that determine the criteria for selecting meeting invitees. The parameters of the MAP are applied against a pool of potential invitee profiles stored in a database to select invitees to the meeting. An electronic mail (email) meeting invitation is then generated and sent to the selected invitees. Invitee responses for each MAP are managed to limit meeting attendance to a predetermined number of attendees. The MAP can be revised by a remedial action, such as the generation of a revised email meeting invitation.

Abstract: A system and method for providing visual keyboard guides according to a programmable set of keys are provided. With the mechanisms of the illustrative embodiments, a user may select for which keys of a keyboard the user wishes to receive visual guides on a display of a data processing device associated with the keyboard. Thereafter, when the user's fingers are in proximity to keys of the keyboard, a comparison of the keys in proximity to the user's instrument to the keys for which visual guides are to be provided is made. If the keys in proximity to the user's instrument match keys for which visual guides are to be provided, a visual guide is displayed on the display of the data processing device. A graphical user interface may be provided to the user for setting which keys are to have associated visual guides.