Methods, systems, and products for managing advertisements

Information

  • Patent Grant
  • 8812363
  • Patent Number
    8,812,363
  • Date Filed
    Tuesday, June 26, 2007
    17 years ago
  • Date Issued
    Tuesday, August 19, 2014
    10 years ago
Abstract
Methods, systems, and products are disclosed for managing advertisements. An advertisement time slot is categorized as overrideable or non-overrideable. The overrideable advertisement time slot categorization allows an associated advertisement to be replaced with a different advertisement. The non-overrideable advertisement time slot may not allow replacement of the associated advertisement. When an advertiser requests to replace the advertisement, and when the advertisement time slot is categorized as overrideable, then the advertisement is replaced with the different advertisement.
Description
COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the United States Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.


FIELD OF THE INVENTION

The present invention relates generally to the field of advertising, and more specifically, to advertising management systems and methods in which a new pricing methodology is employed whereby advertising and content categorized as override may be overridden by an advertiser desiring to pay a premium.


BACKGROUND OF THE INVENTION

Advertisements, also referred to as commercials, are played in between subject portions of a television or radio program, and are the primary source of revenue for television and radio networks. Typically ten to ninety seconds in length, advertisements are grouped together as pre-selected breaks in the broadcast of a program, typically occurring from every few to every fifteen minutes of programming. The number of advertisements and the timing between the placement of the advertisements is dependent on the type of program (e.g., sporting event, sitcom, news program, or movie) and the format of the program (e.g., live or pre-recorded). Television and radio programming, for example, typically include approximately sixteen minutes of advertisements during every hour of programming. Many advertisers use this time as their primary avenue for promoting products, services, and events to consumers.


Advertising rates are generally based on the time slot, popularity of a program, and length of the advertisement. A higher rate is charged for a program with a large audience, due to the theory that more viewers, or listeners, will result in more potential customers receiving the advertisement, which is likely to result in more revenue generated for an advertiser. During the Super Bowl™, for example, a thirty second time spot may cost in the millions of dollars.


Advertisements are not limited to radio and television. In the age of computers, some form of advertisement is displayed on virtually every web-page. Conventional Internet advertising may also be in the form of “pop-up” windows, which are programmed to “pop-up” in their own separate window when a certain web-site is triggered, or opened. Many Internet service providers and search-engine companies are able to offer free services to consumers because of the large amounts of advertising dollars that they receive from advertisers. Like television and radio, the more popular a particular web-site is, the more that it is accessed by consumers, and the more the owner may charge for advertising space.


Advertising is generally more effective when products and services reach consumers that have an interest in the particular product or service. This is referred to as “targeted advertising,” in which an advertiser identifies a group of people as being those that are likely to purchase what is being advertised, and providing the most favorable situation in which the advertisement will reach that pre-determined group of consumers. As an example, it is generally known that a lot of men like sports. It is also generally known that a lot of men drink beer. Therefore, it makes economic sense for an advertiser to run a beer advertisement during sporting events, when it is more likely that men will be watching television. As stated above, advertisement time during the Super Bowl™ is very expensive, and although very expensive, it is common to see a large number of beer commercials during the Super Bowl™. This is normally because advertisers feel that the large premiums paid for time slots during the game will be made-up for by the amount of revenue that the commercial will generate for the company through beer sales.


In determining whether a program, or web-page, may be appropriate for a particular advertisement, advertisers typically consider whether the program attracts large numbers of viewers who are of the same age group, gender, income bracket, and who have similar interests and hobbies with those who are most likely to purchase the product being advertised. Selecting an advertisement and advertising slot in this manner, increases the likelihood that viewers who watch the advertisement will be interested viewers.


Broadcasting networks and advertisers are able to gauge which demographic groups are watching which programs using conventional market research tools. For example, the AC Nielsen™ ratings system tracks television viewing activities by sampling a plurality of households, and estimating the number of viewers of particular programs using the viewing activity data. Advertisers also use market research companies which conduct focus groups that study the effectiveness of different types of television advertisements. These market research tools assist advertisers in creating advertisements, and selecting appropriate time slots in which to run them. To help ensure that viewers watch a particular advertisement, advertisers use techniques that help to grab a viewers attention, such as visual stimulus, catchy slogans, and jingles.


To gauge the effectiveness of their spending, advertisers have long sought information related to potential consumer viewing patterns. There are several conventional devices and techniques that exist for gathering such information. For example, U.S. Pat. No. 4,258,386 issued to Cheung discloses “an apparatus for television audience analysis comprising means for monitoring a television receiver, means responsive to a monitored signal for storing information representative of channel identification and of the time at which a channel is selected and at which the selection of a channel is terminated, and means for reading the stored information periodically.”


As another example, U.S. Pat. No. 4,556,030 issued to Nickerson, et al., discloses “a data storage and transmission system for accumulating and transmitting data from a plurality of remote T.V. panelist locations to a central location. Each remote unit includes a microprocessor, a control memory, and a data store memory. The control memory stores control information for the remote unit, which may include dynamic allocation information. The data store memory is event driven and stores data as to television channel selection and times thereof, and can store viewer reaction data and the like. At a pre-selected time, each remote unit initiates a telephone call to a central location and identifies itself. Upon successful telephone connection between a remote unit and the central location, any data such as viewer habit and/or reaction data and the like contained in the data store memory is transmitted over the telephone line to the central location.”


Other conventional systems and methods provide somewhat more use data than only channel numbers viewed and the time of viewing, such as which products panelists purchase. U.S. Pat. No. 4,816,904 issued to McKenna, et al., discloses “a data gathering system including a plurality of remote units which are controlled from a central location. Each of the remote units are attached to a television receiver which is generally, but not necessarily, attached to a cable system. Each of the remote units may function to determine which of several TV modes is in use as well as to store TV channel selector data, data from an optical input device, and/or data input by viewers representative of the composition of the viewing audience. The data is stored for either later collection by a portable data collector, or for direct transmission via telephone to the central location. A video message for a TV viewer, such as a survey, may be transmitted from the central location and stored at the remote units, for later display on the TV receiver associated with the remote units. The substitution of alternate programming information may also be achieved by the central control point on selected of the remote units.”


Conventionally, panelist monitoring may be used to gauge the effectiveness of advertising on a selected group of panelists. Nevertheless, while panelist monitoring systems like those described above provide somewhat more monitoring data than just TV tuning data, they do so only for limited groups. For example, when more data is gathered (like purchase information), it is done only for the panelist groups, rather than for subscribers of the entire system.


Conventional systems typically capture ratings information that identifies which television shows are viewed, rather than whether the subscriber also viewed the commercials displayed during those shows. What is important to an advertiser is that potential consumers are interested in an advertisement enough to sit through its duration. There is a great deal of money invested in advertising, with the hopes that it will return even greater profits.


Conventional advertising management systems comprise what is generally referred to as a “locked” advertisement delivery system. In this conventional system, time slots are pre-purchased by advertisers. The rates for these time slots are based upon the demand for the particular time slot, as described above. When time slots are purchased, they are grouped together and run as a commercial break during a program, also as described above. When a time slot is purchased, it is no longer available to a second advertiser that may be interested in purchasing the same time slot, but who did not purchase it first. Conventional advertising management systems are basically first-come-first-serve. There may be bidding for a particular slot, but once a rate is agreed to by the advertising slot provider, that time slot is set.


Conventional advertising methods include several drawbacks, such as excluding potential consumers, and including viewers that have no desire to purchase the product or service. Advertisers must continuously evaluate advertising mediums and time slots. When selecting time slots, advertisers take into account which times of the day they are most likely to find large volumes of viewers, whether or not those viewers are of a desired demographic, and which programs are most appropriate to place advertisements into.


What is needed are novel systems and methods that result in more effectively spent advertising dollars for advertisers, which results in increased profit margins for the advertisers and also for network media providers. What is needed are novel systems and methods which result in flexibility and options for advertisers in selecting advertising time slots.


BRIEF SUMMARY OF THE INVENTION

In a preferred embodiment, the present invention provides a pricing methodology whereby scheduled advertising content broadcast to potential consumers may be overridden and replaced by advertising content from an advertiser paying a premium. The method includes a first advertiser occupying an advertisement time slot with a first advertisement, categorizing the first advertisement as an overrideable advertisement or a non-overrideable advertisement, receiving a request from a second advertiser to replace the first advertisement with a second advertisement, and if it is determined that the first advertisement is categorized as an appropriate override advertisement, replacing the first advertisement with the second advertisement. The second advertisement is then broadcast to consumers in place of the first advertisement. Advertisements are broadcast to potential consumers via a broadcast transmission, wherein the broadcast transmission may include a television broadcast, a radio broadcast, and a broadcast sent over the Internet and received on a personal computer.


Various pricing structures may be employed. In one embodiment, the method further involves pricing an overrideable advertisement at a lower price than a non-overrideable advertisement, and wherein a premium is paid to replace the first advertisement with the second advertisement.


A request to replace the first advertisement with the second advertisement may be based upon data obtained using marketing tools and programming ratings collection and analysis systems to identify most-valuable and least-valuable viewers. The ratings collection and analysis systems may track program viewing activities by sampling a plurality of households and estimating the number of viewers of the programs using viewing activity data, focus groups that study the effectiveness of different types advertisements, and product sales reports.


In an alternative embodiment, the advertisement management method further includes receiving requests, and processing, storing, managing, and inserting advertisements using an interactive server. The interactive server compares the second and/or first advertisement with a plurality of pre-determined criteria, and if the advertisement meets a pre-selected number of the plurality of criteria, the interactive server may replace the first advertisement with the second advertisement.


In a further embodiment, the present invention provides a system for managing advertisement programming including a first advertisement provided by a first advertiser, a second advertisement provided by a second advertiser, and an interactive server of a network content provider, wherein the interactive server is operable for replacing the first advertisement with the second advertisement if a plurality of pre-determined criteria are met.


Embodiments of the present invention provide various advantages, such as novel advertisement pricing methodologies, advertisement time slot purchasing options, and targeted advertising methodologies. Embodiments of the present invention provide methods of effective advertising management and targeting that ensure that a particular demographic group receives the most appropriate materials.


Additional objects, advantages, and novel features of the invention will be set forth in part in the description which follows, and in part will become more apparent to those skilled in the art upon examination of the following, or may be learned by practice of the invention.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a exemplary hardware environment of the present invention in which a network provider responds to a request from an advertiser using data obtained from an interactive server;



FIG. 2 is a functional block diagram illustrating one embodiment of the present invention in which an advertiser desiring to replace a scheduled advertisement contacts a network provider; and



FIG. 3 is a functional block diagram illustrating one embodiment of the present invention in which an advertiser desiring to replace a scheduled advertisement contacts a network provider and ultimately an interactive server.





DETAILED DESCRIPTION OF THE INVENTION

As required, detailed embodiments of the present invention are disclosed herein, however, it is to be understood that the disclosed embodiments are merely exemplary of the invention that may be embodied in various and alternative forms. Specific structural and functional details disclosed herein are not to be interpreted as limiting, but merely as a basis for the claims as a representative basis for teaching one skilled in the art to variously employ the present invention. Conventional hardware and systems are shown in block diagram form and process steps are shown in flowcharts.


Referring now to the drawings, in which like numerals indicate like elements throughout the several figures, FIG. 1 illustrates an exemplary hardware environment in which programming content delivered in a scheduled lineup may be overridden by an advertiser desiring to pay a premium. FIG. 1 illustrates various system elements and subsystems that communicate with each other to transmit collected data information and data acknowledgments. The term scheduled is used herein to include the delivery of advertising and content whereby a fixed array of content programming is provided, and payments are made by advertising and content providers based upon that fixed array.


In one embodiment, a first advertiser 20 has a first advertisement already inserted into a scheduled broadcast to be transmitted in the future. The first advertisement has been categorized as an override advertisement, as discussed above. A second advertiser 22 has a second advertisement that is not yet inserted into any broadcast transmission, but desires to insert the second advertisement into the same broadcast transmission as the first advertiser 20. A third advertiser 24 has a third advertisement already inserted into the same broadcast transmission as the first advertiser 20. The third advertisement has been categorized as a non-override advertisement, as will be discussed below. All three advertisers 20, 22, 24 are in communication with a network content provider 26 that controls the broadcast and manages the advertisements.


The network content provider 26, responsible for providing a network service in which advertisements are broadcast to potential consumers, operates and maintains a system equipped to receive signals and other content from the advertisers 20, 22, 24. The network content provider 26 may be any original or secondary source of network programming including, for example, television, radio, Internet, or like digital environment. Content providers 26 may broadcast directly to potential consumers, or alternatively, may broadcast to a provider that receives and retransmits a broadcast to potential consumers. The advertisers 20, 22, 24 furnish content originated by them to the network content provider 26 that incorporates that content into the network content provider's 26 broadcast.


The system of FIG. 1 comprises an interactive server 28 operable for advertisement management. As is shown, the network content provider 26 and the advertisers 20, 22, 24 are connected to the interactive server 28 via the network content provider 26. The interactive server is capable of managing advertisements, receiving requests, checking a plurality of pre-determined criteria, and responding to the requests from the advertisers 20, 22, 24.


Signals containing requests and programming content furnished by the advertisers 20, 22, 24 are sent via suitable communication paths to content provider 26 and ultimately to the interactive server 28 comprising a processor for processing information. A provisioning technique available to an advertiser 22 with Internet access includes a Web-based form of entry of advertisement information. Using such a technique, an advertiser 22 using a browser running on a computer with an Internet connection accesses the interactive server and inputs requests and receives responses. Requests may include specific information relating to a particular advertisement or time slot, such as override and non-override categorization, and the override option. Advertisement schedules, characteristics, identifiers, and pricing may be stored in a database 30 of the interactive server 28. Each individual advertisement may have an associated identifier 32 that is used to identify the specific advertisement. The identifier 32 may include descriptive information such as the time length of the advertisement and file size. When a signal is received by the interactive server 28, the interactive server 28 identifies the selected advertisement and may insert it into a program time slot using if a series of checkpoints are completed and approved, as discussed above.


The network content provider 26 is able to insert the advertisement, identified by the interactive server 28 using its identifier, into the broadcast transmission 34. The primary functionality of the network content provider 26 is provided by the interactive server 28, which stores and manages the advertisements provided by the advertisers, and which responds to requests from the advertisers.


In one embodiment of the present invention, a provisioning method is provided in which an advertiser may access the interactive server 28 and override a prescheduled advertisement based on monitoring and marketing tools. The monitoring and marketing tools provide data to an advertiser which aid in selecting the most desirable time slot for each particular advertisement based on the data. Using data gathered regarding viewing habits, such as set top boxes use for monitoring viewing habits and collecting information, to distinguish more-valuable from less-valuable viewers, along with override and non-override categories, content and advertisements may be matched with more-valuable and less-valuable viewer subsets.



FIG. 2 illustrates a preferred embodiment of an advertising management method in which an advertiser, by paying a premium, may replace a scheduled advertisement with a different advertisement. The method includes a first advertiser having a first advertisement that is scheduled to be broadcast at some time in the future (Block 40). The first advertisement may be part of a group of advertisements which are shown at pre-determined times during a subject program. Typically, one hour of programming usually includes about sixteen minutes of advertising. Each advertisement corresponds with a time slot, and time slots are grouped together to form a commercial break in the programming schedule.


The present invention establishes a pricing methodology whereby an advertisement categorized as override may be overridden, or replaced. When providing an advertisement to a network provider for broadcast, an advertiser has the option of categorizing the advertisement as either an override or a non-override advertisement (Block 42), and paying a corresponding fee based on the category chosen. In an alternative embodiment, a network provider may offer time slots that are pre-categorized as either override or non-override, and an advertiser may purchase a time slot based upon the desired category. Overrideable is hereby defined as capable of being replaced. Non-override is hereby defined as not capable of being replaced. An overrideable advertisement is an advertisement that may be broadcast, or, may be replaced by a different advertisement, either from the same or a different advertiser. A non-overrideable advertisement is an advertisement that will be broadcast, and is not capable of being replaced.


In the preferred embodiment, an advertisement, or time slot, categorized as override is priced at a lower cost than an advertisement, or time slot, categorized as non-override, for the reason that an override advertisement may not be broadcast if replaced. An advertiser may opt to purchase this advertising option due to its lower price. An advertiser may also opt to purchase the option based upon information that may lead the advertiser to believe that their advertisement will most likely not be overridden. The information may include such items as the time of day, the day of the week, the program that the advertisement will be shown during, time slot demand, marketing tools, and previous advertiser replacements. For example, if an advertiser has a limited advertising budget, the advertiser may opt to categorize his/her advertisement as an override advertisement based upon time slot demand and the past history of replacements made during the desired time slot. In another example, if an advertiser has a very limited potential consumer audience that also coincides with a low-demand time slot, the advertiser may choose the lower priced overrideable option to save money.


In the preferred embodiment, an advertisement, or time slot, categorized as non-override is priced at a higher cost than an advertisement, or time slot, categorized as override, for the reason that a non-override advertisement will be broadcast and can not be replaced. An advertiser may opt to purchase this advertising option due to demand and projected audience value. An advertiser may also opt to purchase the option based upon information that may lead the advertiser to believe that the greater cost will lead to greater revenues. The information may include such items as the time of day, the day of the week, the program that the advertisement will be shown during, time slot demand, marketing tools, and previous advertiser replacements.


In the preferred embodiment, an advertiser wishing to override the first advertisement with the second advertisement may be required to pay a premium. The amount of the premium may vary based upon the time slot desired and the characteristics and content of the subject matter surrounding the commercial break. For example, desired override advertising time during a live one-time championship sporting event may be priced at a much higher amount than override advertising time during a regularly scheduled program due to the special nature of the program.


Network providers, such as television and radio, sell advertising space based on the length of time of an advertisement, the day of the week, the time of day, advertiser demand, and the type of program the advertisement will be played during. Most television viewers watch television during the prime-time viewing hours of about 7 pm to about 10 pm, and network providers, therefore, charge higher rates during these viewing hours due to advertiser demand. Internet network providers may sell advertising time based on file size and type, and may also set fees based on the time of day, the day of the week, and specific programs.


Content delivered to a network content provider by an advertiser includes advertisements relating to products, services, and events. The advertisements, in one example referred to as commercials, are played in between the subject potions of the network content providers program. Referring to television and radio broadcasts, advertisements range from about ten to about ninety seconds in length, and are grouped together as pre-selected breaks in the broadcast of the program, occurring every few minutes of programming. The number of advertisements and the timing between the placement of the advertisements is dependent upon the type of program (e.g., sporting event, sitcom, news program, or movie) and the format of the program (e.g., live or pre-recorded). Television and radio programming, for example, typically include approximately sixteen minutes of advertisements during every hour of programming.


The method further includes a second advertiser, having a second advertisement, desiring the time slot occupied by the already scheduled first advertisement. The second advertiser then contacts the appropriate network provider that is in charge of the scheduling of the desired time slot, to inquire about overriding the first advertisement and replacing it with the second advertisement (Block 44). As stated above, only an advertisement categorized as override is capable of being overridden. The network provider then informs the second advertiser of the category of the first advertisement or time slot (Block 46).


The network content provider (26, FIG. 1) checks the first advertisements category and may determine that the first advertisement is an override advertisement, in which case the second advertiser has the option of overriding, or replacing the first advertisement with a second different advertisement. The network content provider 26 may determine that the first advertisement is a non-override advertisement, in which case the second advertiser is not able to replace the first advertisement and must either choose a new first advertisement or time slot (Block 48), or opt not to proceed.


After the network content provider (26, FIG. 1) determines that the first advertisement is capable of being overridden, the network provider 26 goes through a series of checkpoints (Block 50) to determine if the second advertisement may be inserted into the broadcast in the place of the first advertisement. A correct response to the series of checkpoints will lead to the replacement of the first advertisement with the second advertisement (Block 54). An incorrect response to the series of checkpoints leads to the advertiser having to choose an alternative second advertisement to be inserted (Block 52), or opting not to proceed.


The series of checkpoints may include the first and second advertisements lengths in time, the proper fees, technical specifications, and a search to determine when the last time that an advertisement was broadcast relating to the same or similar type product. The time length requirement is to ensure that the second advertisement is an appropriate fit and will not result in a disruption in the broadcast transmission. The proper fees checkpoint is to ensure that a premium has been paid, or will be paid, by the advertiser to override the first advertisement. Technical specifications may include such items as formatting and an appropriate amount of time necessary to implement the change without a causing a disruption in the broadcast transmission. Other technical specifications will be well-known to those of ordinary skill in the art.


To illustrate the series of checkpoints, for example, assume that an advertiser of a sport-utility automobile desires to replace a first sport-utility automobile advertisement, of a competitor, with a second advertisement. The advertisement substitution may involve the network content provider (26, FIG. 1) and ultimately the interactive server (28, FIG. 1) running through a series of checkpoints to determine if a substitution is possible and appropriate. The series may involve verifying that the first advertisement is indeed an advertisement categorized as overrideable. Once verified, the network provider 26 may then determine whether the second advertisement possesses the required characteristics in order to replace the first advertisement, such as equal or near in length time lengths and whether the second advertisement has been recorded in a compatible format with the scheduled broadcast. A further checkpoint may include a search by the network provider 26 or interactive server 28 to determine when the last time an advertisement was broadcast relating to a sport-utility vehicle, or any vehicle, either by the same or different advertiser. The network provider 26 may opt not to replace the first advertisement if the second advertiser had a similar advertisement run in the recent past, such as a term of a few hours.


Referring to FIG. 3, in an alternative embodiment, the pricing methodology discussed above may include the interactive server (28, FIG. 1) operable for advertisement management. The method includes a first advertiser having a first advertisement already inserted into a scheduled broadcast that will be transmitted in the future (Block 40, FIG. 2). The second advertiser having a second advertisement desires the specific time slot occupied by the first advertisement. The second advertiser first contacts the network content provider (Block 60) and ultimately the interactive server 28 of the network content provider (Block 62).


The interactive server 28 receives a request from the second advertiser 22 regarding specifications and override options relating to the first advertisement. The interactive server 28 accesses and retrieves information from the database (Block 64). As stated above, only an advertisement categorized as override is capable of being overridden. The interactive server 28 transmits the requested information to the second advertiser regarding the first advertisement, information including categorization.


The network content provider (26, FIG. 1) checks the first advertisements category (Block 46, FIG. 2) and may determine that the first advertisement is an override advertisement, in which case the second advertiser has the option of overriding, or replacing the first advertisement with a second different advertisement. The network content provider 26 may determine that the first advertisement is a non-override advertisement, in which case the second advertiser is not able to replace the first advertisement and must either choose a new first advertisement or time slot (Block 66), or opt not to proceed.


After the interactive server 28 determines that the first advertisement is capable of being overridden, the interactive server 28 runs through a series of checkpoints (Block 68) to determine if the second advertisement may be inserted into the broadcast in the place of the first advertisement. A correct response to the series of checkpoints will lead to the replacement of the first advertisement with the second advertisement (Block 70). An incorrect response to the series of checkpoints leads to the advertiser having to choose an alternative second advertisement to be inserted (Block 72), or opting not to proceed.


As stated above, the series of checkpoints may include the first and second advertisements lengths in time, the proper fees, technical specifications, and a search to determine when the last time that an advertisement was broadcast relating to the same or similar type product. The time length requirement is to ensure that the second advertisement is an appropriate fit and will not result in a disruption in the broadcast transmission. The proper fees checkpoint is to ensure that a premium has been paid, or will be paid, by the advertiser to override the first advertisement. Technical specifications may include such items as formatting and an appropriate amount of time necessary to implement the change without a causing a disruption in the broadcast transmission. Other technical specifications will be well-known to those of ordinary skill in the art.


In one embodiment, the present invention may acquire data used to select a desired advertising time slot based on a demographics and programming ratings collection and analysis system, as is well known in the art. The ratings collection and analysis systems may track program viewing activities by sampling a plurality of households and estimating the number of viewers of the programs using viewing activity data, focus groups that study the effectiveness of different types advertisements, and product sales reports. Using data gathering technology to identify valuable viewers, override and non-override advertisements may be matched to correspond with most-valuable and least-valuable viewer subsets. In one embodiment, a processor determines valuable viewer subsets by collecting information to create a log about all events or selected events of interest viewed by potential consumers. Other marketing tools may be used to determine valuable viewer subsets, and the information obtained using these marketing tools may aid an advertiser in making decisions regarding when to override a scheduled advertisement.


The systems and methods of the present invention may be employed for use Internet advertising management. In one embodiment, an Internet network content provider may provide advertisements displayed as “pop-up” web-pages. A scheduled programmed first “pop-up” advertisement may be replaced by a second advertisement in a similar manner as described above. Alternative embodiments may include replaceable advertisements displayed on a web-page containing additional content unrelated to the product or service being displayed.


The systems and methods of the present invention may be employed for use in radio broadcasts. A scheduled first advertisement may be replaced by a second advertisement in a commercial break broadcast during a radio program, using the pricing methodology described above. In alternative embodiments, the systems and methods of the present invention may be employed in any additional field in which advertisements are broadcast to viewers.


The foregoing is provided to explain and disclose preferred embodiments of the present invention, modifications to which may be made that still fall within the following claims. For instance, the architecture and programming of the system may be modified. Or, a variety of different manufacturers' servers or databases may be configured in order to implement the system. Further modifications and adaptations to the described embodiments will be apparent to those skilled in the art and may be made without departing from the scope or spirit of the invention and the following claims.

Claims
  • 1. A method, comprising: categorizing, by a server, an advertisement time slot as one of overrideable and non-overrideable, an overrideable advertisement time slot allowing an advertisement of an advertiser to be replaced with a different advertisement of the advertiser, and a non-overrideable advertisement time slot not allowing replacement of the advertisement;storing a webpage in memory of the server;receiving the advertisement from the advertiser and storing the advertisement in the memory of the server;receiving, from the advertiser at the webpage of the server, a request for a future advertisement time slot in a scheduled lineup;providing advertising information to the advertiser in response to the request, the advertising information describing the advertisement scheduled in the future advertisement time slot;receiving, from the advertiser accessing the webpage of the server, a request to replace the advertisement with the different advertisement;determining the advertisement time slot is categorized as overrideable by the advertiser, such that the advertisement time slot is associated with advertisements of the advertiser;determining the advertisement and the different advertisement are equal in time length;determining the different advertisement has been recorded in a compatible format with the scheduled lineup;searching to determine a time of broadcast of a previous advertisement relating to the different advertisement;determining the previous advertisement was broadcast outside a predetermined timeframe;overriding, by the server, the scheduled lineup having the advertisement scheduled in the future advertisement time slot;replacing, by the server, the advertisement in the scheduled lineup with the different advertisement of the advertiser; andbroadcasting an overridden lineup from the server, the overridden lineup having the advertisement replaced by the different advertisement.
  • 2. The method of claim 1, further comprising receiving a financial premium from the advertiser to replace the advertisement.
  • 3. The method of claim 1, further comprising pricing the overrideable advertisement time slot at a lower cost than a non-overrideable advertisement time slot.
  • 4. The method of claim 1, further comprising providing data regarding viewing habits that distinguish more-valuable viewers from less-valuable viewers.
  • 5. The method of claim 4, further comprising matching the advertisements with the more-valuable viewers and with the less-valuable viewers.
  • 6. The method of claim 1, further comprising creating a log of events viewed by potential consumers.
  • 7. A system, comprising: a processor; anda memory storing a program that when executed causes the processor to perform operations, the operations comprising:categorizing an advertisement time slot as one of overrideable and non-overrideable, an overrideable advertisement time slot allowing an advertisement of an advertiser to be replaced with a different advertisement of the advertiser, and a non-overrideable advertisement time slot not allowing replacement of the advertisement;storing a webpage in the memory;receiving different advertisements from the advertiser and storing the advertisements in the memory;receiving, from the advertiser at the webpage, a request for a future advertisement time slot in a scheduled lineup;providing advertising information to the advertiser in response to the request, the advertising information describing the advertisement scheduled in the future advertisement time slot;receiving, from the advertiser accessing the webpage, a request to replace the advertisement with the different advertisement;determining the advertisement time slot is categorized as overrideable to the advertiser, such that the advertisement time slot is associated with advertisements of the advertiser;determining the advertisement and the different advertisement are equal in time length;determining the different advertisement has been recorded in a compatible format with the scheduled lineup;searching to determine a time of broadcast of a previous advertisement relating to the different advertisement;determining the previous advertisement was broadcast outside a predetermined timeframe;overriding the scheduled lineup having the advertisement scheduled in the future advertisement time slot;replacing the advertisement in the scheduled lineup with the different advertisement; andbroadcasting an overridden lineup, the overridden lineup having the advertisement replaced by the different advertisement.
  • 8. The system of claim 7, wherein the operations further comprise receiving a financial premium from the advertiser to replace the advertisement.
  • 9. The system of claim 7, wherein the operations further comprise pricing the overrideable advertisement time slot at a lower cost.
  • 10. The system of claim 7, wherein the operations further comprise providing viewing habits that distinguish more-valuable viewers from less-valuable viewers.
  • 11. The system of claim 10, wherein the operations further comprise matching the advertisements with more-valuable viewers and with less-valuable viewers.
  • 12. A server storing processor-executable code for performing a method of managing advertisements, the method comprising: categorizing, by the server, an advertisement time slot as one of overrideable and non-overrideable, an overrideable advertisement time slot allowing an advertisement of an advertiser to be replaced with a different advertisement of the advertiser, and a non-overrideable advertisement time slot not allowing replacement of the advertisement;storing a webpage in memory of the server;receiving the advertisement from the advertiser and storing the advertisements in the memory of the server;receiving, from the advertiser at the webpage of the server, a request for a future advertisement time slot in a scheduled lineup;providing advertising information to the advertiser in response to the request, the advertising information describing the advertisement scheduled in the future advertisement time slot;receiving, from the advertiser accessing the webpage of the server, a request to replace the advertisement with the different advertisement;determining the advertisement time slot is categorized as overrideable to the advertiser, such that the advertisement time slot is associated with advertisements of the advertiser;overriding, by the server, the scheduled lineup having the advertisement scheduled in the future advertisement time slot;replacing, by the server, the advertisement in the scheduled lineup with the different advertisement; andbroadcasting an overridden lineup from the server, the overridden lineup having the advertisement replaced by the different advertisement.
  • 13. The server of claim 12, further comprising code for providing data regarding viewing habits that distinguish more-valuable viewers from less-valuable viewers.
  • 14. The server of claim 13, further comprising code for matching the advertisements with the more-valuable viewers and with the less-valuable viewers.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a divisional of U.S. application Ser. No. 10/020,779, filed Dec. 14, 2001 and entitled “Advertising and Content Management Systems and Methods”, and incorporated herein by reference in its entirety.

US Referenced Citations (361)
Number Name Date Kind
677209 Chernock et al. Jun 1901 A
3798610 Bliss et al. Mar 1974 A
3886302 Kosco May 1975 A
3924187 Dormans Dec 1975 A
4130833 Chomet Dec 1978 A
4258386 Cheung Mar 1981 A
4361851 Asip et al. Nov 1982 A
4488179 Kruger et al. Dec 1984 A
4566030 Nickerson et al. Jan 1986 A
4567591 Gray et al. Jan 1986 A
4598288 Yarbrough et al. Jul 1986 A
4602279 Freeman Jul 1986 A
4688248 Tomizawa Aug 1987 A
4689661 Barbieri et al. Aug 1987 A
4697209 Kiewitt et al. Sep 1987 A
4698670 Matty Oct 1987 A
4720873 Goodman et al. Jan 1988 A
4816904 McKenna et al. Mar 1989 A
4885632 Mabey et al. Dec 1989 A
4890322 Russell, Jr. Dec 1989 A
4912552 Allison Mar 1990 A
5010585 Garcia Apr 1991 A
5038211 Hallenbeck Aug 1991 A
5046090 Walker et al. Sep 1991 A
5046092 Walker et al. Sep 1991 A
5055924 Skutta Oct 1991 A
5173900 Miller et al. Dec 1992 A
5191645 Carlucci et al. Mar 1993 A
5208665 McCalley et al. May 1993 A
5247347 Litteral et al. Sep 1993 A
5249044 VonKohorn Sep 1993 A
5251324 McMullan, Jr. Oct 1993 A
5287181 Holman Feb 1994 A
5335277 Harvey et al. Aug 1994 A
5339315 Maeda et al. Aug 1994 A
5343240 Yu Aug 1994 A
5357276 Banker et al. Oct 1994 A
5374951 Welsh Dec 1994 A
5382970 Kiefl Jan 1995 A
5389964 Oberle Feb 1995 A
5404393 Remillard Apr 1995 A
5410326 Goldstein Apr 1995 A
5410344 Graves et al. Apr 1995 A
5436653 Ellis et al. Jul 1995 A
5440334 Walters et al. Aug 1995 A
5444499 Saitoh Aug 1995 A
5446490 Blahut et al. Aug 1995 A
5446919 Wilkins Aug 1995 A
5481294 Thomas et al. Jan 1996 A
5497185 Dufresne et al. Mar 1996 A
5500681 Jones Mar 1996 A
5504519 Remillard Apr 1996 A
5532732 Yuen et al. Jul 1996 A
5532735 Blahut et al. Jul 1996 A
5534911 Levitan Jul 1996 A
5537143 Steingold et al. Jul 1996 A
5559548 Davis Sep 1996 A
5579124 Aijala et al. Nov 1996 A
5585838 Lawler et al. Dec 1996 A
5585865 Amano Dec 1996 A
5589892 Knee et al. Dec 1996 A
5596994 Bro Jan 1997 A
5600364 Hendricks Feb 1997 A
5600366 Schulman Feb 1997 A
5606359 Youden et al. Feb 1997 A
5606602 Johnson et al. Feb 1997 A
5608448 Smoral et al. Mar 1997 A
5619247 Russo Apr 1997 A
5630119 Aristides May 1997 A
5649200 Leblang et al. Jul 1997 A
5659350 Hendricks Aug 1997 A
5661516 Carles Aug 1997 A
5710815 Ming et al. Jan 1998 A
5721827 Logan Feb 1998 A
5724521 Dedrick Mar 1998 A
5724525 Beyers, II et al. Mar 1998 A
5724607 Brandt Mar 1998 A
5740549 Reilly et al. Apr 1998 A
5752159 Faust et al. May 1998 A
5754393 Hiratsuka et al. May 1998 A
5754775 Adamson et al. May 1998 A
5754939 Herz May 1998 A
5758257 Herz et al. May 1998 A
5758259 Lawler May 1998 A
5774170 Hite et al. Jun 1998 A
5777614 Ando et al. Jul 1998 A
5778182 Cathey et al. Jul 1998 A
5794210 Goldhaber et al. Aug 1998 A
5796952 Davis et al. Aug 1998 A
5798785 Hendricks et al. Aug 1998 A
5809481 Baron Sep 1998 A
5818438 Howe Oct 1998 A
5838314 Neel Nov 1998 A
5848396 Gerace Dec 1998 A
5848397 Marsh Dec 1998 A
5850249 Massetti et al. Dec 1998 A
5850447 Peyret Dec 1998 A
5854897 Radziewicz Dec 1998 A
5861906 Dunn et al. Jan 1999 A
5867226 Wehmeyer et al. Feb 1999 A
5872588 Aras et al. Feb 1999 A
5872834 Teitelbaum et al. Feb 1999 A
5883942 Lim et al. Mar 1999 A
5892508 Howe Apr 1999 A
5892536 Logan Apr 1999 A
5900908 Kirkland May 1999 A
5901209 Tannhenbaum et al. May 1999 A
5917481 Rzeszewski Jun 1999 A
5931908 Gerba et al. Aug 1999 A
5945988 Williams et al. Aug 1999 A
5946636 Uyeno et al. Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5973683 Cragun Oct 1999 A
5983227 Nazem Nov 1999 A
5991735 Gerace Nov 1999 A
5991799 Yen et al. Nov 1999 A
6002393 Hite Dec 1999 A
6005597 Barrett Dec 1999 A
6026368 Brown et al. Feb 2000 A
6029045 Picco et al. Feb 2000 A
6029195 Herz Feb 2000 A
6076094 Cohen Jun 2000 A
6081840 Zhao Jun 2000 A
6100916 August Aug 2000 A
6119098 Guyot et al. Sep 2000 A
6128009 Ohkura et al. Oct 2000 A
6134531 Trewitt et al. Oct 2000 A
6134532 Lazarus Oct 2000 A
6160570 Sitnik Dec 2000 A
6163644 Owashi et al. Dec 2000 A
6172674 Ethridge Jan 2001 B1
6172677 Stautner et al. Jan 2001 B1
6177930 Chernock et al. Jan 2001 B1
6177931 Alexander et al. Jan 2001 B1
D437879 Weinandt Feb 2001 S
6185614 Cuomo Feb 2001 B1
6199076 Logan et al. Mar 2001 B1
6202210 Judtke Mar 2001 B1
6226618 Downs et al. May 2001 B1
6236975 Boe et al. May 2001 B1
6252586 Freeman et al. Jun 2001 B1
6253189 Feezell et al. Jun 2001 B1
6279157 Takasu Aug 2001 B1
6282713 Kitsukawa Aug 2001 B1
6286042 Hasselberg et al. Sep 2001 B1
6292549 Lung et al. Sep 2001 B1
6304644 Karnowski Oct 2001 B2
6310943 Kowlaski Oct 2001 B1
6314568 Ochiai Nov 2001 B1
6314577 Pocock Nov 2001 B1
6317488 DePond et al. Nov 2001 B1
6324271 Sawyer et al. Nov 2001 B1
6327574 Kramer et al. Dec 2001 B1
6332021 Latter et al. Dec 2001 B2
6338043 Miller Jan 2002 B1
6339639 Henderson Jan 2002 B1
6341161 Latter et al. Jan 2002 B1
6345187 Berthoud et al. Feb 2002 B1
6345256 Milsted et al. Feb 2002 B1
6351637 Lee Feb 2002 B1
6353929 Houston Mar 2002 B1
6366772 Arnson Apr 2002 B1
6397057 Malackowski et al. May 2002 B1
6400408 Berger Jun 2002 B1
6408437 Hendricks et al. Jun 2002 B1
6427003 Corbett Jul 2002 B1
6434747 Khoo et al. Aug 2002 B1
6438216 Aktas Aug 2002 B1
6442262 Moss et al. Aug 2002 B1
6442263 Beaton et al. Aug 2002 B1
6445781 Heinmiller et al. Sep 2002 B1
6446261 Rosser Sep 2002 B1
6457010 Eldering Sep 2002 B1
6463468 Bush Oct 2002 B1
6463585 Hendricks et al. Oct 2002 B1
6477704 Cremia Nov 2002 B1
6480589 Lee et al. Nov 2002 B1
6487538 Gupta et al. Nov 2002 B1
6493439 Lung et al. Dec 2002 B2
6496569 Pelletier et al. Dec 2002 B2
6496571 Wilson Dec 2002 B1
6496818 Ponte Dec 2002 B1
6498841 Bull et al. Dec 2002 B2
6505348 Knowles Jan 2003 B1
6507839 Ponte Jan 2003 B1
6510417 Woods et al. Jan 2003 B1
6529591 Dosani et al. Mar 2003 B1
6530082 DelSesto et al. Mar 2003 B1
6542583 Taylor Apr 2003 B1
6542591 Amro et al. Apr 2003 B1
6546092 Corbett et al. Apr 2003 B2
6553110 Peng Apr 2003 B1
6553178 Abecassis Apr 2003 B2
6560317 Quagliana May 2003 B1
6560327 McConnell May 2003 B1
6570971 Latter et al. May 2003 B2
6571344 Sitnik May 2003 B1
6574319 Latter et al. Jun 2003 B2
6584490 Schuster et al. Jun 2003 B1
6631181 Bates et al. Oct 2003 B1
6631360 Cook Oct 2003 B1
6639979 Kim Oct 2003 B1
6647548 Lu et al. Nov 2003 B1
6650743 Heinmiller et al. Nov 2003 B2
6675383 Wheeler et al. Jan 2004 B1
6698020 Zigmond et al. Feb 2004 B1
6714992 Kanojia et al. Mar 2004 B1
6718021 Crockett et al. Apr 2004 B2
6718551 Swix et al. Apr 2004 B1
6728355 Kowalski Apr 2004 B2
6731727 Corbett et al. May 2004 B2
6738978 Hendricks et al. May 2004 B1
6748058 Schwend et al. Jun 2004 B1
6748068 Walsh et al. Jun 2004 B1
6757691 Welsh et al. Jun 2004 B1
6766003 Moss et al. Jul 2004 B2
6766524 Matheny et al. Jul 2004 B1
D494953 Leung Aug 2004 S
6771754 Pelletier et al. Aug 2004 B2
6771755 Simpson Aug 2004 B1
6772209 Chernock Aug 2004 B1
6785301 Chapman et al. Aug 2004 B1
6785368 Eason et al. Aug 2004 B1
6798879 Beham Sep 2004 B1
6807267 Moss et al. Oct 2004 B2
6810115 Fukuda Oct 2004 B2
6810527 Conrad et al. Oct 2004 B1
6816481 Adams et al. Nov 2004 B1
6826271 Kanabar et al. Nov 2004 B1
6831974 Watson et al. Dec 2004 B1
6845151 Peng Jan 2005 B2
6845396 Kanojia et al. Jan 2005 B1
6845398 Galensky Jan 2005 B1
6850988 Reed Feb 2005 B1
6950804 Strietzel Sep 2005 B2
6970641 Pierre Nov 2005 B1
6976268 Courtney Dec 2005 B2
6983478 Grauch et al. Jan 2006 B1
6985822 Hoyte Jan 2006 B2
6985882 Del Sesto Jan 2006 B1
7000245 Pierre Feb 2006 B1
7010492 Bassett et al. Mar 2006 B1
7020336 Cohen-Solal Mar 2006 B2
7020652 Matz Mar 2006 B2
7039599 Merriman May 2006 B2
7039932 Eldering May 2006 B2
7086075 Swix Aug 2006 B2
7100183 Kunkel et al. Aug 2006 B2
7212979 Matz et al May 2007 B1
7228283 Hornstein Jun 2007 B1
7260823 Schlack et al. Aug 2007 B2
7269835 Swix Sep 2007 B2
7343354 Hennessey Mar 2008 B2
7441260 Kurapati Oct 2008 B1
7444658 Matz Oct 2008 B1
7587323 Matz Sep 2009 B2
7587732 Wright et al. Sep 2009 B2
7593858 Matz Sep 2009 B2
7617508 Gray Nov 2009 B2
7661118 Matz Feb 2010 B2
7979877 Huber et al. Jul 2011 B2
8086491 Matz Dec 2011 B1
8196166 Roberts et al. Jun 2012 B2
20010004733 Eldering Jun 2001 A1
20020002488 Muyres et al. Jan 2002 A1
20020004382 Cox et al. Jan 2002 A1
20020009184 Shnier Jan 2002 A1
20020013757 Bykowsky Jan 2002 A1
20020016748 Emodi et al. Feb 2002 A1
20020016964 Aratani et al. Feb 2002 A1
20020032906 Grossman Mar 2002 A1
20020035600 Ullman et al. Mar 2002 A1
20020038455 Srinivasan et al. Mar 2002 A1
20020046099 Frengut et al. Apr 2002 A1
20020049631 Williams Apr 2002 A1
20020049967 Haseltine et al. Apr 2002 A1
20020056109 Tomsen May 2002 A1
20020056118 Hunter et al. May 2002 A1
20020078443 Gadkari et al. Jun 2002 A1
20020083441 Flickinger et al. Jun 2002 A1
20020087573 Reuning et al. Jul 2002 A1
20020090933 Rouse et al. Jul 2002 A1
20020092017 Klosterman et al. Jul 2002 A1
20020092019 Marcus Jul 2002 A1
20020100064 Ward et al. Jul 2002 A1
20020122401 Xiang et al. Sep 2002 A1
20020123928 Eldering et al. Sep 2002 A1
20020133817 Markel Sep 2002 A1
20020143647 Headings Oct 2002 A1
20020157108 Kitsukawa et al. Oct 2002 A1
20020157109 Nakano et al. Oct 2002 A1
20020169709 Kitayama Nov 2002 A1
20020183098 Lee et al. Dec 2002 A1
20020191755 Lew et al. Dec 2002 A1
20020199197 Winter Dec 2002 A1
20030003990 Von Kohorn Jan 2003 A1
20030028432 Troyansky et al. Feb 2003 A1
20030028873 Lemmons Feb 2003 A1
20030049967 Narumo et al. Mar 2003 A1
20030050100 Dent Mar 2003 A1
20030067554 Klarfield et al. Apr 2003 A1
20030092384 Ross, III May 2003 A1
20030093792 Labeeb et al. May 2003 A1
20030095650 Mize May 2003 A1
20030108184 Brown et al. Jun 2003 A1
20030110489 Gudorf et al. Jun 2003 A1
20030110497 Yassin et al. Jun 2003 A1
20030115597 Yassin et al. Jun 2003 A1
20030148758 McMullin Aug 2003 A1
20030149975 Eldering et al. Aug 2003 A1
20030172374 Vinson Sep 2003 A1
20040125929 Pope Jul 2004 A1
20040128682 Liga et al. Jul 2004 A1
20040133467 Siler Jul 2004 A1
20040163101 Swix Aug 2004 A1
20040193483 Wolan Sep 2004 A1
20040193488 Khoo et al. Sep 2004 A1
20040194131 Ellis et al. Sep 2004 A1
20040215559 Rebenack et al. Oct 2004 A1
20040220858 Maggio Nov 2004 A1
20040248560 Bedingfield et al. Dec 2004 A1
20040261127 Freeman et al. Dec 2004 A1
20050060759 Rowe et al. Mar 2005 A1
20050071863 Matz Mar 2005 A1
20050084084 Cook et al. Apr 2005 A1
20050132419 Gray Jun 2005 A1
20050137958 Huber et al. Jun 2005 A1
20050235318 Grauch Oct 2005 A1
20050239448 Bayne Oct 2005 A1
20050251820 Stefanik Nov 2005 A1
20050278741 Robarts et al. Dec 2005 A1
20050283401 Swix Dec 2005 A1
20050283792 Swix Dec 2005 A1
20060031882 Swix Feb 2006 A1
20060075456 Gray Apr 2006 A1
20060106710 Meek et al. May 2006 A1
20060161952 Herz et al. Jul 2006 A1
20060168616 Candelore Jul 2006 A1
20060253884 Gray Nov 2006 A1
20060271438 Shotland et al. Nov 2006 A1
20060271552 McChesney et al. Nov 2006 A1
20060288367 Swix Dec 2006 A1
20070038514 Patterson et al. Feb 2007 A1
20070083885 Harding Apr 2007 A1
20070226761 Zalewski et al. Sep 2007 A1
20070250846 Swix Oct 2007 A1
20070255622 Swix Nov 2007 A1
20070288350 Bykowsky Dec 2007 A1
20080004962 Muthukrishnan et al. Jan 2008 A1
20080104634 Gajdos et al. May 2008 A1
20080147497 Tischer Jun 2008 A1
20080148311 Tischer Jun 2008 A1
20080167943 O'Neil Jul 2008 A1
20080263586 Thomas Oct 2008 A1
20090292703 Matz Nov 2009 A1
20100083298 Gray et al. Apr 2010 A1
20100088725 Swix Apr 2010 A1
20100100435 Matz Apr 2010 A1
20100191601 Matz Jul 2010 A1
20100257037 Matz Oct 2010 A1
20110178877 Swix Jul 2011 A1
Foreign Referenced Citations (11)
Number Date Country
0 424 648 Feb 1991 EP
1 162 840 Dec 2001 EP
WO 9222983 Dec 1992 WO
WO 94 17609 Aug 1994 WO
WO 96 07270 Mar 1996 WO
WO 9831114 Jul 1998 WO
WO 99 04561 Jan 1999 WO
WO 9945702 Oct 1999 WO
WO 99 52285 Oct 1999 WO
WO 0147156 Jun 2001 WO
WO 03 052551 Jun 2003 WO
Non-Patent Literature Citations (27)
Entry
Ehrmantraut et al., “The Personal Electronic Program Guide—Towards the Pre-selection of Individual TV Programs”, 8 Pages, 1996.
www.actv.com, Screen Print, Oct. 8, 2000.
“ACTV, Inc. Offers Exclusive Preview of ‘Individualized Television’ at Official All-Star Café,” Business Wire, Sep. 16, 1998.
“ACTV's HyperTV & ‘Individualized Television’ to be Powered by Sun Microsystems' JavaTV Technology,” Business Wire, Apr. 21, 1999.
Whitaker, Jerry, “Interactive TV: Killer Ap or Technical Curiosity?”, Broadcast Engineering, Dec. 1999.
Dickson, Glen, “Digital TV gets specifically directed,” Broadcasting & Cable, Jun. 5, 2000.
Reed, David, “The future is digital,” Precision Marketing, v. 13, n.51, p. 27, Sep. 21, 2001.
Wasserman, Todd, “Mining Everyone's Business.” Brandweek, Feb. 28, 2000. 19 pages.
Cauley, Leslie, “Microsoft, Baby Bell Form Video Alliance,” The Wall Street Journal, Sep. 26, 1994.
“allNetDevices:—Report: Interactive TV Soon to Become Direct Marketing Tool,” allNetDevices, www.devices.internet.com/com—cgi/print/print.cgi?url=http://devices.../report—interactive.html, (Nov. 16, 2001) pp. 1-2.
“Liberate Technologies—Solutions,” Digital Cable Two-Way, www.solutions.liberate.com/architecture/dc2.html, (Nov. 16, 2001) p. 1 of 1.
“Liberate Technologies—Solutions,” Digital Broadband Telco, www.solutions.liberate.com/architecture/db.html, (Nov. 16, 2001) p. 1 of 1.
“Liberate Technologies—Solutions,” Liberate Connect Suite, www.solutions.liberate.com/products/connect—suite/html, (Nov. 16, 2001) pp. 1-2.
“Liberate Technologies—Solutions,” Liberate imprint Server™, www.solutions.liberate.com/products/imprint—server.html, (Nov. 16, 2001) p. 1 of 1.
“Liberate Technologies—Solutions,” Liberate Mediacast Server™ www.solutions.liberate.com/products/mediacast—server.html, (Nov. 16, 2001) pp. 1-2.
“Spike High Performance Server Array,” Mixed Signals Technologies, Inc., www.mixedsignals.com, itvinfo@mixedsignals.com (2000) p. 1.
“Power, flexibility, and control,” RespondTV, www.respondtv.com/whyrespond.html (Nov. 16, 2001) pp. 1-2.
“It just clicks!,” RespondTV, www.respondtv.com/inaction.html, (Nov. 16, 2001) pp. 1-2.
“The Wink System,” Wink System Diagram, www.wink.com/contents/tech—diagram.html, (Nov. 16, 2001) p. 1 of 1.
“What is Wink?,” www.wink.com/contents/whatiswink.html, (Nov. 16, 2001) p. 1 of 1.
“How Wink Works,” What is Wink: How wink works, www.wink.com/contents/howitworks.html, (Nov. 16, 2001) p. 1 of 1.
“What is Wink: Examples,” What is Wink—Examples, www.wink.com/contents/examples.html, (Nov. 16, 2001) pp. 1-2.
“Nielsen Media Research—Who We Are & What We Do,” www.nielsenmedia.com/whoweare.html, (Oct. 11, 2001) pp. 1-4.
Aggarwal et al (“A Framework for the Optimizing of WWW Advertising” Proceedings of the International IFIP/GI Working Conference Trends in Distributed Systems for Electronic Commerce, pp. 1-10, Year of Publication: 1998).
Ehrmantraut et al., “The Personal Electronic Program Guide—Towards the Pre-selection of Individual TV Programs”, pp. 1-8, 1996.
U.S. Appl. No. 08/779,306, Grauch.
U.S. Appl. No. 10/017,742, Matz.
Related Publications (1)
Number Date Country
20070255622 A1 Nov 2007 US
Divisions (1)
Number Date Country
Parent 10020779 Dec 2001 US
Child 11821926 US