The present invention relates to selecting the best performing advertisements for Internet users, and to a pricing model that determines an appropriate price for those advertisements, and in particular to pricing and ranking ads in an inventory of ads so as to achieve predictable delivery for advertisers while maximizing property value for publishers and networks.
When advertisers purchase distribution for their ads on a web site or set of web sites, there are a few standard ways they can pay for that. The simplest models are:
1. A fixed cost per thousand impressions (“CPM model”). If an advertiser pays a fixed rate CPM (e.g., $1.00), they pay the fixed rate of $1 for every thousand times their ad is shown (impression), regardless of user response rate to that ad.
2. A fixed cost-per-click model (“CPC”). If an advertiser pays a fixed rate (e.g., $1) CPC, they pay $1 every time a user clicks on that ad, regardless of the number of times the ad is shown without being clicked.
However in many situations the market value of ad space may vary. For example, if the ad is to be matched to a keyword on an active search page or in contextual advertising, then the value of that ad space depends on the market value for that keyword (e.g., “casino” is typically more valuable for advertising than “paper”).
As a result, auction models have become common. In this case advertisers bid on how much they're willing to pay—typically on a CPC basis—to have their ad shown on those pages, against that keyword or context, etc. An ad server implements the placement algorithm and is able to maximize the value of that ad space by selecting the highest paying ads at any given time. In some cases the ad server will also combine performance data for that ad (including click-through-rate (“CTR”) data, for example) with the bid price per click to determine the effective CPM (“eCPM”) rate for each ad, and then choose the highest eCPM ads. Or combining with purchase or other conversion data to establish a cost per action (“CPA”), and then include CPA values among the selection process. In either case the ad selection formula typically relies on an auction-based marketplace. The term eCPM is an industry standard known to persons of ordinary skill in the art. As is readily understood by a person of ordinary skill in the art, CPA is also known as cost-per-conversion, or cost-per-sale.
The eCPM value reflects what the equivalent CPM is if the pricing model is based on CPC or some other non-CPM model. For example, a CPC rate multiplied by the ad's click-through-rate multiplied by 1000 yields the eCPM for that ad based on its response.
Auctions provide a means for extracting appropriate market value for ad space, but they also create problems. For example, when advertisers purchase a fixed CPM or CPC campaign to distribute their ads with a publisher or media company, they know that they will get that distribution or otherwise there was an issue with the vendor. In an auction marketplace the advertiser does not have the same clear contract with the publisher, since other advertisers may outbid them for the distribution at any time. As an example, if the advertiser wants to run a campaign that generates 30,000 clicks in a month within a budget of $15,000, then they might bid a maximum CPC of $0.50 per click, they might start off getting the 1000 clicks per day that they want, then a few days later suddenly drop to 100 or 0 clicks per day when their ad is preempted by a higher paying advertiser. At that point they have to adjust their bid to a higher per click rate to restart the campaign (risking exceeding the original advertising budget), or move the campaign to another publisher, etc.
As such, fixed price models are good for advertiser predictability but bad for publishers and networks looking to maximize the value of dynamic properties. Auction models are good for publishers and networks' ability to maximize value, but bad for advertiser predictability. Advertisers generally prefer to pay based on a CPC rate, thus assuring they pay only when users show interest in their ad and generate a response. Inapposite, publishers like to be paid on a CPM basis, thus providing a more predictable return—publishers know how much traffic they get to their site (how many pages they serve to their users per-day or per-month); so on a CPM basis they can predict revenue independent of an advertising campaign performance.
Furthermore, the ad traffic generated by users visiting publishers' sites can be anywhere from a very low value to a very high value for advertising. Even within a single publisher the value of traffic generated often has a range of value to advertisers. However, without an ability to classify that traffic into different groups that separate the higher from the lower value traffic, publishers typically must strike simplistic CPM deals with the networks that deliver advertisements. These deals provide publishers with a flat CPM rate that does not give publishers upside on their higher value traffic.
Further, missing from the art are methods and systems for placement of internet advertisements or services that provide publishers an upside value on their higher value traffic, and provide publishers with a more predictable return. The present invention can satisfy one or more of these and other needs.
The present invention relates to a method for pricing and ranking ads in an inventory of ads that achieves both predictable delivery for advertisers and maximized property value for publishers and networks.
In accordance with one aspect of the invention, a system sets ad prices to be variable based on ad performance. This internet-based system for pricing advertisements, comprises an Internet property, operated by a publisher, that contains at least one page capable of displaying advertisements. Advertisement performance metrics to classify Internet ad traffic into performance groups that are associated with a minimum profitable eCPM amount. A rule base associates particular ads in an advertisement inventory to at least one ad traffic classification performance group, and further associates each of the particular ads with a minimum price and a maximum price. An ad server receives a request to deliver an ad, and consults with a classification system to determine the performance group corresponding to parameters of the ad request. The rule base is applied to the advertisement inventory associated with that performance group so as to select one or more associated advertisements, and deliver the one or more advertisements for display on the Internet property page. A historical statistics repository Includes the historical performance of each advertisement in the inventory associated with an ad traffic classification. A pricing and optimization engine applies these historical statistics to establish the current performance of each ad in each performance group, compares the current performance to an expected performance, establishes a new price between the minimum price and the maximum price.
In accordance with another aspect of the invention, an Open Purchase Order ad server maintains the profitability of the publisher and network even when a publisher's agreed CPM or eCPM rates cannot be delivered by the network.
These and other aspects, features, steps and advantages can be further appreciated from the accompanying figures and description of certain illustrative embodiments.
By way of overview and introduction, presented and described are embodiments of a method and system that prices and ranks ads in an inventory of ads. Different embodiments interrelate at least the following elements:
1. One or more internet publishers or properties that contain pages where ads may be shown
2. An inventory of ads available to be shown on those properties
3. A rule base that may be used to match particular ads in the inventory to particular classifications of ad traffic
4. A classification system that may be applied to a set of properties or pages
5. A set of prices that correspond to each class in the classification system
The term “ad traffic” has the meaning of a real time series of requests for ads or ad impressions generated by end-viewers of advertisements from their Web browsers, or other Internet content access device.
With reference to
The rule base contains rules that match each ad in the inventory to a classification of the ad traffic such as a contextual category of the current page determined by a real-time contextualization process. In other embodiments these rules match ads to keywords, or to a combination of categories and keywords, or match ads to other features, and combination of features, as mentioned earlier regarding traffic classification methods. The set of prices contains a minimum CPC price for each category in the classification system. The network and ad server use a CPC pricing model for ads.
At step 130, the ad server prices the same ad differently according to the category of the page. This results from the ad server running an algorithm embodying the invention which ensures that the CPC assigned by the ad server to each ad delivered to the page is above the minimum CPC for that page's category. In a further embodiment, the ad server also tracks the historical performance, step 140, of that particular ad when placed on pages within the same category of page, to better ensure a profitable eCPM. If the ad is getting a lower than expected CTR then the ad server increases the CPC for that ad in that category, therefore raising the eCPM.
Advertisers are able to manage their customer acquisition budget by specifying a maximum price that they are willing to pay per click for either a particular ad, or for that particular ad when delivered/placed on a particular category of page. The ad server, through the algorithm, increases the CPC for that ad only up to the maximum specified value, and then pre-empts the ad from being shown in that category if the eCPM is still below the target for that category. An incremental increase of the CPC can be specified by the advertiser, and the ad server continues to monitor the ad performance. The CPC for the ad can then be raised in incremental steps if the CTR remains non-competitive for that category of page. As long as the CPC price set by the ad server is greater than the established minimum price per category, and that the price is not more than the maximum CPC price specified by the advertiser, then that ad remains placed.
This process through the algorithm achieves:
1. Ad pricing that changes according to the classification of the ad traffic in which the ad is shown
2. Ad pricing that changes according to the historical performance of that ad in terms of its rate for generating positive user response such as clicks or sales.
3. Automatic removal of ads that do not meet both the advertiser's budget and the publisher's and/or network's market value for its pages.
Other embodiments are within the scope of this description and include, but are not limited to, the following embodiments.
An embodiment where the classification system classifies by website, publisher “account” on the ad server, and/or by “publisher domain” (e.g., all *.yahoo.com pages may be classified under the yahoo.com publisher domain). This embodiment allows minimum prices to be set on a per-publisher basis, separately or in conjunction with the page classifications. In a further embodiment, a minimum price per-ad format is set on a per publisher basis. Here the different “ad formats” are different formats for presenting the same ad content, e.g., different sizes and orientations. Further, the rate may be set per-area of the page, e.g., top, bottom, and so forth.
In another embodiment, the classification system can classify on a time basis—e.g., time of day, day of week, month, holidays, and so forth. Classification parameters can further include user-based information such as recent pages viewed or user demographic classifications. However, these user-based classifications are not necessary for the operation of the present invention.
A minimum price and expected ad performance in one or more classes of ad traffic are established by an advertising network in a manner where that prices are known to be profitable for both the publisher and the network. A maximum price for the ad in each class of traffic is established by the advertiser, such that the ad campaign is also affordable to the advertiser. The actual price charged to the advertiser is revised by the network on a regular basis according to the ad's performance, where the actual price remains within a range between the minimum price and a maximum prices. Thus, publisher profitability and advertiser affordability are assured. The ad is pre-empted only for underperformance on its own merits, e.g., there is no possible price meeting the requirements of the publisher, the advertiser, and the network.
In another embodiment, a method maintains the publisher's and network's profitability even when the agreed upon publisher's CPM and/or eCPM rates cannot be delivered by the network. In accordance with this method, a network called an Open Purchase Order Network (“OPO” Network) negotiates a CPM rate with the publisher that is higher than the CPM rate the publisher is currently paid for their traffic by another network. The OPO Network classifies the publisher's traffic into higher and lower value traffic for advertising, delivers the ads to the publisher, and pays the agreed higher CPM for the higher value traffic. The OPO Network also passes back to the publisher that portion of traffic for which the network cannot profitably pay the agreed CPM. The publisher then in turn gives that passed back traffic from the OPO Network to a conventional network that pays the publisher the previously agreed lower CPM rate. According to this method the publisher increases its revenue without risk, and the OPO Network gets the first right of refusal on all traffic sent by the publisher, which previously went directly to the conventional ad network.
In another embodiment the classification system extends beyond page classification to include broader “ad traffic” classification. “Ad traffic” is actual real time series of requests for ads generated by users (end-viewers of ads) from their Web browsers or other Internet content access device. Where navigation information from users generates pages through static criteria, ad traffic develops a dynamic criteria which combines page identification with user based classification and time factors (e.g., time of day, day of week, date range, holidays). Ad traffic also can account for the quantity of unique users getting the ad. The number of times a user has had an ad delivered is monitored, and the ad can be stopped to prevent repetitive placement of the ad to a user—this is commonly known as frequency capping. Thus, ad traffic criteria can include user-based classifications such as geographic location, user demographics, and the number of times that user has an ad delivered by the present invention in the last day or other period of time. It could also include time of day or day of week classifications.
A further embodiment of the invention is a method that selects from an inventory of services not typically classified as advertisements. For example, these services could be types of syndicated web content, or affiliate links used in affiliate marketing. The fees for placing the services on a page are then determined by the processes described above.
Another embodiment where a CPM “media buy” may be used to hedge the performance of a CPC media buy. In this embodiment the pricing and placement algorithms described above are used to place ads from the CPC inventory when such inventory is available. When CPC inventory is not available then ads can be shown from the fixed-price CPM inventory. This results in a combination of the CPC and CPM pricing models so as to partition space for different ads based on an above/below price level or based on the available ad inventory.
The OPO Network owes the publisher nothing for that transaction. But, the publisher is able to forward that ad request immediately to the prior art network 650 that is able to pay the publisher the same (e.g., $1.00) baseline eCPM. As a result the publisher is able to generate higher revenues from the same ad traffic without any increased risk, and the OPO Network has a right of first refusal on all traffic, keeping that portion which is of highest value and passing back the rest.
The server shown in
Furthermore, computers, and other electronic devices can be remotely connected to the communication network via a modem and temporary telephone link. The number of WANs, LANs, and routers may be increased or decreased arbitrarily and is independent of the spirit or scope of this invention.
As such, it will be appreciated that the Internet itself may be formed from a vast number of such interconnected networks, computers, and routers. Generally, the term “Internet” refers to the worldwide collection of networks, gateways, routers, and computers that use Transmission Control Protocol/Internet Protocol (“TCP/IP”) and other packet based protocols to communicate with one another. An embodiment of the invention may be practiced over the Internet without departing from the spirit or scope of the invention. Processes embodying the invention also may be practiced m a peer-to-peer or grid computing architecture, without departing from the spirit or scope of the invention.
The media used to transmit information in communication links as described above illustrates one type of computer-readable media, namely communication media. Generally, computer-readable media includes any media that can be accessed by a computing device. Computer-readable media may include computer storage media, communication media, or any combination thereof.
Communication media typically embodies computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any Information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, communication media includes wired media such as twisted pair, coaxial cable, fiber optics, wave guides and other wired media, and wireless media such as acoustic, RF, infrared and other wireless media.
Those of ordinary skill in the art will appreciate that the server 721 may include many components which are not shown in
Server 721 also can include a central processing unit, a video display adapter, and a mass memory, all connected via a bus. The mass memory generally includes random access memory (“RAM”), read-only memory (“ROM”), and one or more permanent mass storage devices, e.g., a hard disk drive, a tape drive, an optical drive, and/or a floppy disk drive. The mass memory stores an operating system that controls the operation of server 721. A basic input/output system (“BIOS”) is also provided for controlling the low-level operation of server 721. The hard disk-drive is utilized by server 721 to store, among other things, application programs, databases, and program data. Among the programs and databases stored in server 721 is the algorithm, base-rules, classifications, and advertisement performance criteria metrics discussed above for embodiments of the invention. The programs can be stored in memory such as RAM 716, ROM 732, or on CR-ROM 726. The databases can be stored on disk drive 728, in database 790, or in another data store as is known in the art.
The mass memory may include volatile and nonvolatile, removable and non-removable media, which can implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules or other data. Examples of computer storage media include RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computing device.
The mass memory may also store program code and data for providing a web site. More specifically, the mass memory may store applications, including but not limited to: a WWW server application, email server application, and programs. WWW server application includes computer executable instructions which, when executed by server 721, generate browser displays, including performing the logic described above. Server 721 may include a JAVA virtual machine, an SMTP handler application for transmitting and receiving email, an HTTP handler application for receiving and handing HTTP requests, and an HTTPS handler application for handling secure connections. The HTTPS handler application may also be used for communication with an external security application to send and receive sensitive information, such as email, in a secure fashion.
Server 721 also comprises an input/output interface for communicating with external devices, such as a mouse, keyboard, scanner, or other input devices not shown in
Data may be stored in a data store, such as, for example, database 730, to which server 721 has access. Access to database 730 can also be made available to client computer 710, or any computer connected to the communication network. Database 730 can be a one or a combination of any of the mass storage technologies discussed above, as is known by a person of skill in the art.
Those of ordinary skill in the art will appreciate that client computer may include many more components than those described above. However, it is not necessary that those generally-conventional components be shown in order to disclose an illustrative environment for practicing embodiments of the present invention.
Client computer includes a central processing unit (CPU), a video display adapter, and memory. The memory generally includes RAM, ROM, and a permanent mass storage device, such as a disk drive. The memory stores an operating system, a BIOS, and programs for controlling the operation of the client computer. The memory can also be loaded with client software specific to practicing embodiments of the present invention. It will be appreciated that these components may be stored on a computer-readable medium and loaded into memory of client computer 210 using a drive mechanism associated with the computer-readable medium, such as a floppy disk drive, an optical drive, such as a CD-ROM/DVD-ROM drive, and/or a hard disk drive. An input/output interface can also be provided for receiving input from a mouse, keyboard, or other input device. The memory, network interface unit, video display adapter, and input/output interface are all connected to the processing unit via a bus. Other peripherals may also be connected to the processing unit in a similar manner. For example, the interface may also be provided at a terminal, for displaying accessed data, computed scores, and so on.
It should be understood that the client machine could be embodied as any one of a great variety of electronic devices ranging from general purpose computing machines such as workstations, desktop, laptop and notebook computers, thin clients, and terminals to less general devices such as personal digital assistants (PDAs) or smart phones, to a special purpose devices such as DVB-H enabled mobile devices. Regardless of the physical form of the client computer, it includes a local memory, a processor, and input/output capabilities to permit interaction with a user.
Thus, while there have been shown, described, and pointed out fundamental novel features of the invention as applied to several embodiments, it will be understood that various omissions, substitutions, and changes in the form and details of the illustrated embodiments, and in their operation, may be made by those skilled in the art without departing from the spirit and scope of the invention. Substitutions of elements from one embodiment to another are also fully intended and contemplated. The invention is defined solely with regard to the claims appended hereto, and equivalents of the recitations therein.
This application claims priority to and is a continuation of pending U.S. application Ser. No. 11/502,751, filed Aug. 11, 2006, which claims the benefit of priority, under 35 U.S.C. § 119(e), to U.S. Provisional Application No. 60/707,869, filed Aug. 11, 2005, and titled “Method and System for Placement and Pricing of Internet-Based Advertisements or Services,” which is hereby incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4723212 | Mindrum et al. | Feb 1988 | A |
4914590 | Loatman et al. | Apr 1990 | A |
4996642 | Hey | Feb 1991 | A |
5105184 | Pirani et al. | Apr 1992 | A |
5353218 | De Lapa et al. | Oct 1994 | A |
5401946 | Weinblatt | Mar 1995 | A |
5435087 | Karkar et al. | Jul 1995 | A |
5459306 | Stein et al. | Oct 1995 | A |
5483650 | Pedersen et al. | Jan 1996 | A |
5483763 | Liu | Jan 1996 | A |
5583763 | Atcheson et al. | Dec 1996 | A |
5621812 | Deaton et al. | Apr 1997 | A |
5636346 | Saxe | Jun 1997 | A |
5696962 | Kupiec | Dec 1997 | A |
5724521 | Dedrick | Mar 1998 | A |
5742768 | Gennaro et al. | Apr 1998 | A |
5754938 | Herz et al. | May 1998 | A |
5761655 | Hoffman | Jun 1998 | A |
5822748 | Cohen et al. | Oct 1998 | A |
5832474 | Lopresti et al. | Nov 1998 | A |
5835087 | Herz et al. | Nov 1998 | A |
5838317 | Bolnick et al. | Nov 1998 | A |
5848408 | Jakobsson et al. | Dec 1998 | A |
5855008 | Goldhaber et al. | Dec 1998 | A |
5864863 | Burrows | Jan 1999 | A |
5918014 | Robinson | Jun 1999 | A |
5930764 | Melchione et al. | Jul 1999 | A |
5943648 | Tel | Aug 1999 | A |
5943679 | Niles et al. | Aug 1999 | A |
5948061 | Merriman et al. | Sep 1999 | A |
5961593 | Gabber et al. | Oct 1999 | A |
5974408 | Cohen et al. | Nov 1999 | A |
5987454 | Hobbs | Nov 1999 | A |
5991735 | Gerace | Nov 1999 | A |
6006197 | d'Eon et al. | Dec 1999 | A |
6009410 | LeMole et al. | Dec 1999 | A |
6016487 | Rioux et al. | Jan 2000 | A |
6018734 | Zhang et al. | Jan 2000 | A |
6026409 | Blumenthal | Feb 2000 | A |
6044376 | Kurtzman, II | Mar 2000 | A |
6081750 | Hoffberg et al. | Jun 2000 | A |
6094681 | Shaffer | Jul 2000 | A |
6104503 | Shimura et al. | Aug 2000 | A |
6134532 | Lazarus et al. | Oct 2000 | A |
6141010 | Hoyle | Oct 2000 | A |
6185614 | Cuomo et al. | Feb 2001 | B1 |
6189003 | Leal | Feb 2001 | B1 |
6236978 | Tuzhilin | May 2001 | B1 |
6253188 | Witek et al. | Jun 2001 | B1 |
6256633 | Dharap | Jul 2001 | B1 |
6308202 | Cohn et al. | Oct 2001 | B1 |
6317718 | Fano | Nov 2001 | B1 |
6327574 | Kramer et al. | Dec 2001 | B1 |
6327590 | Chidlovskii et al. | Dec 2001 | B1 |
6339761 | Cottingham | Jan 2002 | B1 |
6356899 | Chakrabarti et al. | Mar 2002 | B1 |
6366298 | Haitsuka et al. | Apr 2002 | B1 |
6381465 | Chern | Apr 2002 | B1 |
6453315 | Weissman | Sep 2002 | B1 |
6526440 | Bharat | Feb 2003 | B1 |
6529903 | Smith et al. | Mar 2003 | B2 |
6615209 | Gomes et al. | Sep 2003 | B1 |
6629092 | Berke | Sep 2003 | B1 |
6658423 | Pugh et al. | Dec 2003 | B1 |
6668256 | Lynch | Dec 2003 | B1 |
6678681 | Brin | Jan 2004 | B1 |
6725203 | Seet et al. | Apr 2004 | B1 |
6725259 | Bharat | Apr 2004 | B1 |
6754873 | Law et al. | Jun 2004 | B1 |
6804659 | Graham et al. | Oct 2004 | B1 |
6955908 | Lambl | Oct 2005 | B1 |
7058592 | Heckerman | Jun 2006 | B1 |
7076443 | Emens et al. | Jul 2006 | B1 |
7089194 | Berstis | Aug 2006 | B1 |
7149741 | Burkey et al. | Dec 2006 | B2 |
7257589 | Hull et al. | Aug 2007 | B1 |
7337127 | Smith | Feb 2008 | B1 |
7353246 | Rosen et al. | Apr 2008 | B1 |
7472102 | Heckerman | Dec 2008 | B1 |
7584120 | Yun | Sep 2009 | B1 |
7945476 | Subramanian | May 2011 | B2 |
20020010625 | Smith et al. | Jan 2002 | A1 |
20020042791 | Smith et al. | Apr 2002 | A1 |
20020107735 | Henkin et al. | Aug 2002 | A1 |
20020120503 | Iwayama et al. | Aug 2002 | A1 |
20020123912 | Subramanian et al. | Sep 2002 | A1 |
20020123988 | Dean et al. | Sep 2002 | A1 |
20020133481 | Smith et al. | Sep 2002 | A1 |
20020154162 | Bhatia et al. | Oct 2002 | A1 |
20020184088 | Rosenberg | Dec 2002 | A1 |
20040059708 | Dean et al. | Mar 2004 | A1 |
20040119740 | Chang et al. | Jun 2004 | A1 |
20040122811 | Page | Jun 2004 | A1 |
20040186776 | Llach | Sep 2004 | A1 |
20050165615 | Minar | Jul 2005 | A1 |
20070067215 | Agarwal | Mar 2007 | A1 |
Number | Date | Country |
---|---|---|
6617700 | Feb 2001 | AU |
0443503 | Jul 1997 | EP |
WO1999046719 | Sep 1999 | WO |
WO1999063453 | Dec 1999 | WO |
WO2000058897 | Oct 2000 | WO |
WO2001044992 | Jun 2001 | WO |
WO2001057721 | Aug 2001 | WO |
WO2001090956 | Nov 2001 | WO |
WO2002037220 | May 2002 | WO |
Entry |
---|
“Infoseek Spin-Off Makes News Real”, Multimedia Daily, vol. 5, Issue 22, BRP Publications (Feb. 4, 1998). |
“Yellowbrix Promises Gold”, Interactive PR & Marketing News, vol. 6, Issue 24, Phillips Business Information (Nov. 26, 1999). |
Dvorak, John C., “Advertising Just for You”, Boardwalk Magazine, pp. 142-143, vol. 13, No. 12 (Dec. 1999). |
“NewsReal Changes Name to YellowBrix; Bridges the Gap Between Content and Commerce; YellowBrix Technology ‘Makes Web Sites Smart’ by Advancing Access to Content and Commerce”, PR Newswire, Financial News, PR Newswire Association, Inc. (Feb. 28, 2000). |
Bob Tedeschi, Spy on Your Customers (They Want You to)—New Web Tracking Technology Turns Browsers Into Paying Customers (Company Business and Marketing), Ziff Davis Smart Business for the New Economy 58, ISSN: 1528-4034 (Aug. 1, 2001). |
Notification of Transmittal of the International Search Report or the Declaration and Search for PCT/US01/45483 (dated Aug. 28, 2002). |
International Search Report, PCT/US01/45483 (dated Aug. 28, 2002). |
International Preliminary Examination Report, PCT/US01/45483 (dated Jan. 31, 2003), to which the present application is the U.S. National Phase Application under 35 U.S.C. § 371. |
International Preliminary Examination report, PCT/US01/45483 (dated Jan. 31, 2003). |
Notification of Transmittal of International Preliminary Examination Report for PCT/US01/45483 (dated Jan. 31, 2003). |
New Media Age, p. S16, Centaur Communications Ltd. (Feb. 19, 2004). |
International Search Report, PCT/US2006/031744 (dated Sep. 18, 2007). |
Written Opinion of the International Searching Authority, PCT/US2006/031744 (dated Sep. 18, 2007). |
International Preliminary Report on Patentability, PCT/US2006/031744 (dated Feb. 12, 2008). |
Reply to Office Action in U.S. Appl. No. 11/929,585 (dated Dec. 31, 2008). |
Reply to Office Action in U.S. Appl. No. 11/929,585 (dated Jul. 2, 2009). |
Reply to Office Action in U.S. Appl. No. 11/929,563 (dated Oct. 7, 2009). |
Number | Date | Country | |
---|---|---|---|
20140236738 A1 | Aug 2014 | US |
Number | Date | Country | |
---|---|---|---|
60707869 | Aug 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11502751 | Aug 2006 | US |
Child | 14266013 | US |