Abstract: Connection state information for Instant Message (IM) users is collected and stored by an IM client. Connection state information for everyone in a sender's buddy list is replicated and stored by the sender's IM client. The IM clients are updated as updates are made on the IM server. This enables simplified direct connection between IM clients when the IM server is down. Client-to-client IM searches are performable, wherein a search is transparently initiated against entries in the user's buddy list, i.e., the user's client directly contacts each available buddy in the user's buddy list using the stored connection state information of the buddy(ies), and it then queries the connection state information of all of the entries in their buddy list(s). For times when a user is not actively on-line, a listener service can be enabled at boot time for the user's PC or laptop computer.

Abstract: The present invention provides for exchanging a gift card. Data associated with a first gift card is provided. The data associated with the first gift card is validated. Either a money rebate associated with the first gift card, or a second gift card is selected. The first gift card is exchanged for either a money rebate or the second gift card. An exchange fee is generated by both the vendor associated with the gift card and the company performing the exchange.

Abstract: A method, an apparatus, and a computer program are provided for dynamically routing traffic routs based on traffic reports. Utilizing current in-car navigation systems, a new implementation of that system can be developed where alternate routes can be plotted around varying traffic events. By receiving radio or Radio Frequency (RF) communications regarding current traffic conditions, the in-car navigation system can be modified to plot alternate routes. Also, the in-car navigation systems could utilize computer memory to develop histories of events so that reoccurring traffic events such as rush hour conditions can be avoided.

Abstract: In the method of the present invention, a customer of a service provider would be placed in hold while waiting to speak to a customer service representative. The method and system of the invention would recognize the telephone number of the caller using a “caller ID” system. If this call is the first time the caller has ever called, the caller would be presented with an audible listing of listening choices that would include but not be limited to the latest news, the weather (of the caller's location), financial headlines, or a selection of music stations (via cable radio, for example). The caller would then speak or type his/her preference into the keypad and the selection would be played. If the caller does not like the selection, the caller can then speak another selection or type the new selection as many times as the caller prefers. The caller selection is recorded in a caller preference database.

Abstract: A methodology for configuring the connection of adapters to bus controllers or other possibly failing components (PFCs) in a logically partitioned environment. The present invention comprises an Adapter Placement Program (APP), two Adapter Threshold Programs (ATPs), three Sequential Ranking Programs (SRPs), and three Weighting Factor Programs (WFPs). The APP determines the criteria the administrator desires to use to place the adapters on the bus controllers or other PFCs and selects the appropriate program to execute the adapter placement. The ATPs classify the adapters as either “hot” or “not hot” based on a traffic intensity threshold and place the adapters to the bus controllers or other PFCs. The SRPs rank the adapters and place the adapters to the bus controllers or other PFCs based on their rank. The WFPs assign weighting factors to the adapters and place the adapters to bus controllers or other PFCs based on the adapters' weighting factors.

Abstract: A methodology for prioritizing and printing documents on a plurality of printers is disclosed. The present invention comprises a Prioritization Program (PP), a Classification Program (CP), a Specific Printer Program (SPP), a Color Printer Program (CPP), and a Black/White Printer Program (B/WPP). The PP prioritizes the documents when there are a plurality of documents waiting to be printed. The CP analyzes each page of the document to determine where to send the page. The SPP, CPP, and B/WPP compile the pages from the printer holding queues to form a print job, analyze the available printers to determine the printer with the shortest wait time, and send the print job to the appropriate printer. The document may then be reassembled from the various printers to produce a finished document which was printed in considerably less time than the prior art printing methods.

Abstract: A methodology for printing a document on a plurality of printers is disclosed. The present invention comprises a Classification Program (CP), a Specific Printer Program (SPP), a Color Printer Program (CPP), and a Black/White Printer Program (B/WPP). The CP analyzes each page of the document to determine where to send the page. The SPP, CPP, and B/WPP compile the pages from the printer holding queues to form a print job, compare the print job to a printer page threshold, and separate the print job if necessary. The SPP, CPP, and B/WPP also analyze the available printers to determine the printer with the shortest wait time and send the print job to the appropriate printer. The document may then be reassembled from the various printers to produce a finished document which was printed in considerably less time than the prior art printing methods.