Abstract: A method for presenting pre-approved and pre-underwritten offers to a customer may include: receiving targeting criteria based on at least one of current accounts with the financial institution, assets, creditworthiness, and credit risk for an offer for a financial product; identifying a target population of customers for the offer by applying the targeting criteria to a population of customers; reviewing each customer in the target population for underwriting for the financial product based on inferred income for each customer and accounts that each customer has with the financial institution, wherein the underwriting is performed before the financial product is offered; determining a channel to present the offer to one of the customers that passed underwriting; communicating the offer to the customer over the selected channel; and providing an accepted offer to a fulfilment engine, wherein the fulfilment engine initiates an account opening for the financial product.

Abstract: One embodiment of the present invention provides a system that facilitates optimizing content delivery on a network. During operation, the system receives an item of content at a first client. During the download of the content or after downloading the content, the first client receives a broadcast request for the content from a second client on the same local subnet. Upon receiving the broadcast request, the first client sends a broadcast response to the local subnet, wherein the broadcast response identifies a multicast address to which the first client will deliver the content. The first client then delivers the content to the multicast address so that the second client and any other interested clients on the local subnet can receive the content.

Abstract: The present invention provides a novel method and apparatus for performing real-time computer garbage collection, in a manner that offers unprecedented low bounds on the worst-case frequency and duration of the collection task. The invention is used with a plurality of data objects and with one or more mutator programs. The mutators and a garbage collector run on one or more processors. The mutators each have a corresponding thread with a corresponding thread state. In the present invention, execution of all mutators is temporarily restricted at the start of each new garbage collection cycle. However, unrestricted execution of a mutator is quickly resumed, as soon as that mutator's thread state is processed. The remainder of the garbage collection cycle may be performed concurrently with the mutators.

Abstract: The present invention provides a novel method and apparatus for performing real-time computer garbage collection, in a manner that offers unprecedented low bounds on the worst-case frequency and duration of the collection task. The invention is used with a plurality of data objects and with one or more mutator programs. The mutators and a garbage collector run on one or more processors. The mutators each have a corresponding thread with a corresponding thread state. In the present invention, execution of all mutators is temporarily restricted at the start of each new garbage collection cycle. However, unrestricted execution of a mutator is quickly resumed, as soon as that mutator's thread state is processed. The remainder of the garbage collection cycle may be performed concurrently with the mutators.