Abstract:
A web browser magnifies the content of the whole page in memory and displays the relevant portion in a magnifier with hyperlinks. The web browser then maps the magnified display to the original document. Thus, manipulation of the mouse in the magnified display may result in an action with respect to the original document. The user may then select a link for navigation within the magnified display. Alternatively, the web browser may analyze the original web page and construct magnifier contents on the basis of either the document object model, extensible markup language (XML), or hypertext markup language (HTML) representation of the magnified portion.
Abstract:
A method, system, and computer program product for providing products to a user via an automated product dispensing machine is provided. In once embodiment, an automatic product dispensing machine in a micronetwork of proximally located diverse automatic product dispensing machines receives a request for an item. Responsive to a determination that the item is unavailable at a current automatic product dispensing machine, the automatic product dispensing machine provides a user with an alternative redemption product, such as, for example, a coupon that may be redeemed at another automatic product dispensing machine or at a nearby store.
Abstract:
A web browser magnifies the content of the whole page in memory and displays the relevant portion in a magnifier with hyperlinks. The web browser then maps the magnified display to the original document. Thus, manipulation of the mouse in the magnified display may result in an action with respect to the original document. The user may then select a link for navigation within the magnified display. Alternatively, the web browser may analyze the original web page and construct magnifier contents on the basis of either the document object model, extensible markup language (XML), or hypertext markup language (HTML) representation of the magnified portion.
Abstract:
Provided is a method, system, and program for implementing an auction. Scheduled event records for a user are maintained within a computer database, wherein each scheduled event record indicates a scheduled event for the user at a calendar time slot. A request is received for bids for a service from the user indicating a time period, wherein the service is to be performed during a calendar time slot within the indicated time period. A determination is made of scheduled event records for the user within the indicated time period. A template is generated to display a calendar for the indicated time period showing time slots. Available time slots comprise time slots in the indicated time period that do not include one scheduled event as indicated in the scheduled event records. At least one bid for the service is received for one available time slot in which the service is to be performed, wherein the bid indicates an amount.
Abstract:
An improved method, apparatus, and computer implemented instructions for processing a check in an automatic teller machine in a data processing system. A check is received from a user at the automatic teller machine. The check is scanned to generate an image. A transaction is performed involving the check. The image is transmitted to a mobile device associated with the user, wherein the image is in a format for use with a financial program.
Abstract:
A method, computer program product, and apparatus for providing a user rating service for online auctions is disclosed. Objective criteria, such as credit information, are combined with subjective ratings to create a user profile. Using objective criteria to supplement user ratings treats new users more fairly and prevents auction participants from inflating their ratings collusively. The user profile may be shared among online auction services, so that a user's aggregate transaction and ratings history may be used at a number of sites.
Abstract:
A methodology for operating a data sharing application in a peer-to-peer network is presented. After a first peer node receives a request for a copy of a specified file from a second peer node, the first peer node may either return a copy of the specified file or a response message containing an alternate node list associated with the specified file. The alternate node list contains a set of node identifiers indicating a set of alternate peer nodes within the peer-to-peer network that may have a copy of the specified file. The alternate node list is dynamically maintained at each peer node. The response provided by the first peer node, i.e. either a copy of the specified file or the alternate node list, can be determined based on an operational condition of the first peer node, e.g., whether or not the first peer node is experiencing an overload condition.
Abstract:
A method, apparatus, and computer implemented instructions for restricting a fan-out type search of a distributed database. A search request is received indicating that a requesting node originating the search request desires to avoid receiving search results including inaccessible nodes. Responsive to receiving the search results from other nodes, the search results are filtered to remove search results from inaccessible nodes to form filtered search results. The filtered search results are passed to the requesting node.
Abstract:
A method and a system is presented for pruning a peer-to-peer network such that a peer-to-peer search within the peer-to-peer network is initiated beginning with those nodes on which relevant content has previously been found for particular search keywords. For each completed search, a peer node gathers client rating results and then forwards the rating information to a rating server; these results reflect the degree to which searches successfully located content for keywords in a search using particular peer nodes. A rating server maintains a database of results received from nodes. Prior to initiating a new search at a peer node, the peer node consults one or more rating databases to retrieve a set of initial nodes to which the node should initiate the new search in order to maximize the speed and success of finding relevant content. The node then performs the new search using the set of initial nodes.
Abstract:
Accessibility insurance coverage management is provided. An insurance server receives a coverage request from a requestor that includes a user identifier corresponding to a user (i.e. policyholder). The insurance server matches the user identifier with a stored policyholder identifier and retrieves accessibility data corresponding to the matched policyholder identifier. If required, the insurance server updates the policyholder's accessibility data by receiving accessibility data from an accessibility database server. The insurance server identifies the policyholder's coverage using the user's accessibility data along with the user's policy information. The insurance server sends a message to the requestor which indicates an amount of the particular item corresponding to the coverage request the insurance server covers. The insurance server receives accessibility service bills on a frequent basis, such as monthly. The insurance server verifies the billing information, pays the bill, and updates policyholder claims paid to date information.