Techniques for displaying impressions in documents delivered over a computer network

Information

  • Patent Grant
  • 8086697
  • Patent Number
    8,086,697
  • Date Filed
    Monday, October 31, 2005
    18 years ago
  • Date Issued
    Tuesday, December 27, 2011
    12 years ago
Abstract
In one embodiment, an impression to be displayed in a placement of a web page is selected from candidate impressions that may be displayed in the placement. The candidate impression may be chosen based on behavioral data and a placement identifier particularly identifying the placement. The behavioral data may include categories of websites visited by an end-user on the client computer. The candidate impressions may be in learning modes, and the impression displayed in the placement may be selected based on its learning mode and revenue generation capability.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates generally to computer systems, and more particularly but not exclusively to displaying of impressions in documents delivered over a computer network.


2. Description of the Background Art


The Internet is an example of a computer network. On the Internet, end-users (i.e. consumers) on client computers may access various types of information resident in server computers. Information on the Internet is typically available in the form of documents referred to as “web pages.” A server computer that provides web pages over the Internet is also referred to as a “web server” or a “website”. A website comprises a plurality of web pages. A website may provide information about various topics or offer goods and services, for example. Just like in other medium, such as radio and television, advertisements allow websites to provide free access to web pages and other services. That is, advertising revenues help pay for the development and maintenance of websites.



FIG. 1 shows a flow diagram schematically illustrating an example of how an advertisement is delivered to a client computer 120 on the Internet. A web page 132 has an advertising space 134 where an advertising server 140 may serve an advertisement 142. The web server 130 provides the web page 132 to the client computer 120 (arrow 151) upon request, such as by pointing a web browser to the uniform resource locator (URL) of the web page 132 on the Internet. When the web page 132 is received in the client computer 120, program code of the web page 132 requests the advertisement 142 from the advertising server 140 (arrow 152). In response, the advertising server 140 serves the advertisement 142 to the web page 132 (arrow 153), resulting in the advertisement 142 being displayed in the advertisement space 134. The advertisement 142 is normally designated to be displayed in the advertisement space 134 regardless of whether or not the advertisement 142 is the best advertisement for that space.


SUMMARY

In one embodiment, an impression to be displayed in a placement of a web page is selected from candidate impressions that may be displayed in the placement. The candidate impression may be chosen based on behavioral data and a placement identifier particularly identifying the placement. The behavioral data may include categories of websites visited by an end-user on the client computer. The candidate impressions may be in learning modes, and the impression displayed in the placement may be selected based on its learning mode and revenue generation capability.


These and other features of the present invention will be readily apparent to persons of ordinary skill in the art upon reading the entirety of this disclosure, which includes the accompanying drawings and claims.





DESCRIPTION OF THE DRAWINGS


FIG. 1 shows a flow diagram schematically illustrating an example of how an advertisement is delivered to a client computer on the Internet.



FIG. 2 shows a schematic diagram of an example computer that may be used in embodiments of the present invention.



FIG. 3 a schematically shows a computing environment in accordance with an embodiment of the present invention.



FIG. 4 shows a flow diagram of an example impression serving process in the computing environment of FIG. 3 in accordance with an embodiment of the present invention.



FIG. 5 schematically shows the components of an impressions manager in accordance with an embodiment of the present invention.



FIG. 6 shows a flow diagram of a method of selecting an impression among a plurality of candidate impressions that may be displayed in a placement of a particular web page in accordance with an embodiment of the present invention.



FIG. 7 shows a flow diagram of a method of displaying an impression on a web page in accordance with an embodiment of the present invention.





The use of the same reference label in different drawings indicates the same or like components.


DETAILED DESCRIPTION

In the present disclosure, numerous specific details are provided, such as examples of apparatus, components, and methods, to provide a thorough understanding of embodiments of the invention. Persons of ordinary skill in the art will recognize, however, that the invention can be practiced without one or more of the specific details. In other instances, well-known details are not shown or described to avoid obscuring aspects of the invention.


Being computer-related, it can be appreciated that the components disclosed herein may be implemented in hardware, software, or a combination of hardware and software (e.g., firmware). Software components may be in the form of computer-readable program code stored in a computer-readable storage medium, such as memory, mass storage device, or removable storage device. For example, a computer-readable storage medium may comprise computer-readable program code for performing the function of a particular component. Likewise, computer memory may be configured to include one or more components, which may then be executed by a processor. Components may be implemented separately in multiple modules or together in a single module.


Referring now to FIG. 2, there is shown a schematic diagram of an example computer that may be used in embodiments of the present invention. Depending on its configuration, the computer shown in the example of FIG. 2 may be employed as a client computer, a web server, an impressions server, or other data processing apparatus. The computer of FIG. 2 may have less or more components to meet the needs of a particular application. As shown in FIG. 2, the computer may include a processor 101, such as those from the Intel Corporation or Advanced Micro Devices, for example. The computer may have one or more buses 103 coupling its various components. The computer may include one ore more input devices 102 (e.g., keyboard, mouse), a computer-readable storage medium (CRSM) 105 (e.g., floppy disk, CD-ROM, flash memory), a CRSM reader 104 (e.g., floppy drive, CD-ROM drive, flash memory reader), a display monitor 109 (e.g., cathode ray tube, flat panel display), a communications interface 106 (e.g., network adapter, modem) for coupling to a network, one or more data storage devices 107 (e.g., hard disk drive, optical drive, non-volatile memory), and a main memory 108 (e.g., RAM). Software embodiments may be stored in the computer-readable storage medium 105 for reading into the data storage device 107 or the main memory 108. Software embodiments in the main memory 108 may be executed by the processor 101. In the example of FIG. 2, the main memory 108 is shown as comprising software modules 110, which may comprise one or more software components of a client computer 320 or impressions server 340 described later on below. The software modules 110 may be loaded from the computer-readable storage medium 105, the data storage device 107, or over the Internet by way of the communications interface 106, for example. The software modules 110 and other programs in the main memory 108 may be executed by the processor 101.



FIG. 3 a schematically shows a computing environment 300 in accordance with an embodiment of the present invention. The computing environment 300 may include one or more client computers 320, one or more web servers 330, and one or more impressions servers 340. Only one of each is shown in FIG. 3 for clarity of illustration. In practice, one impressions server 340 may serve a plurality of client computers 320. A client computer 320, a web server 330, and an impressions server 340 may communicate over a public computer network 308, which in the example of FIG. 3 comprises the Internet.


A client computer 320 is typically, but not necessarily, a personal computer such as those running the Microsoft Windows™ operating system, for example. In the example of FIG. 3, the client computer 320 includes a web browser 322, a behavior monitor 324, and a cookie 326. The web browser 322 may be a commercially available web browser or web client. In one embodiment, the web browser 322 comprises the Microsoft Internet Explorer™ web browser. The web browser 322 allows an end-user on the client computer 320 to access a web page over the Internet. A web page, such as a web page 332 of a web server 330, has a corresponding address referred to as a uniform resource locator (“URL”). The web browser 322 is pointed to the URL of a web page to receive that web page in the client computer 320. The web browser 322 may be pointed to a URL by entering the URL at an address window of the web browser 322, or by clicking a link pointed to that URL, for example.


The behavior monitor 324 is a client-side program in that it is stored and run in the client computer 320. The behavior monitor 324 may comprise computer-readable program code for monitoring the online activities of the end-user on the client computer 320. It is to be noted that the mechanics of monitoring an end-user's online activities, such as determining where an end-user is navigating to, the URLs of web pages received in the client computer 320, the domain names of websites visited by the end-user, what the end-user is typing on a web page, whether the end-user clicked on a link on a web page, when the end-user activates a mouse or keyboard, and the like, is, in general, known in the art and not further described here. For example, the behavior monitor 324 may learn of end-user online activities by receiving event notifications from the web browser 322. The behavior monitor may work in conjunction with another server (not shown). Techniques for monitoring end-user online activities using a client-side program are also disclosed in commonly-owned U.S. Pat. No. 7,069,515, entitled “Method and Apparatus for Displaying Messages in Computer Systems,” filed on May 21, 2002 by Scott G. Eagle, David L. Goulden, Anthony G. Martin, and Eugene A. Veteska, issued Jun. 27, 2006, which is incorporated herein by reference in its entirety.


In one embodiment, websites and web pages are grouped according to categories. Each category may include a listing of websites and/or web pages (e.g. by URL) relevant to that category. For example, websites and web pages relating to vacations, such as those from tourism bureaus, hotel chains, rental cars, and other vacation-related websites, may be included in the “vacations” category, websites and web pages relating to cars may be included in the “cars” category, and so on. A website or web page may belong to more than one category. For example, a website pertaining to wood working may belong to both the “power tool” category and the “hobby category.” A human researcher may categorize popular websites and web pages by categories and store the categories and associated websites and web pages (as identified by URL, for example) in a category table or database accessible to the behavior monitor 324. The behavior monitor 324 may listen for the URLs of websites visited by the end-user, determine the categories of the websites (e.g. by consulting the category table), and store or facilitate storage of the categories in the cookie 326.


In one embodiment, the behavior monitor 324 further includes computer-readable program code for recording the impressions already delivered to the client computer 320 and whether or not the end-user interacted (e.g. by mouse clicking) with any of the impressions. Each impression that has already been displayed in the client computer 320 may be identified by its impression ID and stored in the cookie 326. As will be more apparent below, this allows the impressions server 340 to minimize repeated displaying of the same impressions or similar impressions that the end-user is likely not interested in.


The cookie 326 may also contain a client computer ID that anonymously and uniquely identifies the client computer 320. The cookie 326 is shown as a single cookie in the example of FIG. 3 for clarity of illustration. The contents of the cookie 326 may also be separated out in multiple cookies without detracting from the merits of the present invention. The use of cookies to carry various types of data is also disclosed in the commonly-assigned U.S. Pat. No. 7,693,863, entitled “Method and Device for Publishing Cross-Network User Behavioral Data,” filed on Sep. 14, 2005, by Anthony Martin, David L. Goulden, Dominic V. Bennett, Roger Petersen, and Remigiusz Paczkowski, issued Apr. 6, 2010, which is incorporated herein by reference in its entirety.


A web server 330 may comprise hardware and software components for providing web pages to client computers 320. In the example of FIG. 2, the web server 330 provides a web page 332 over the Internet. The web page 332 may contain information that is of interest to end-users surfing on the Internet. The web page 332 may include a placement 334 in which an impression may be displayed. The placement 334 may have an associated identifier, referred to as “placement ID,” for identifying the particular web page 332 where the placement 334 is located. As will be more apparent below, the placement ID allows the impressions server 340 to identify the particular web page requesting the impressions. This enables the impressions server 340 to select what it deems as the best impression for that web page. The placement ID may be in the form of a hypertext markup language (HTML) tag embedded in the web page 332, for example.


As used in the present disclosure, an “impression” refers to a message configured to be displayed a certain way on the web page 332. In the example of FIG. 3, the placement 334 includes computer-readable program code for requesting an impression from the impressions server 340 and displaying the impression in the web page 332 in the client computer 320. For example, the placement 334 may include HTML code for pulling an impression from the impressions server 340.


An impressions server 340 may comprise hardware and software components for serving impressions to client computers 320. The impressions server 340 may comprise an impressions manager 342 and an impressions database 344. The components and functionalities of the impressions server 340 may be in one or more server computers.


An impression may comprise a message and a creative. A creative is a design of how the message is to be presented to end-users. As can be appreciated, a single message may be displayed using different creatives. For example, an announcement of the release of a new movie (message) may be displayed as a conventional banner (first creative), a banner with accompanying music (second creative), a banner displaying the movie's trailer (third creative), or a banner with varying texts depending on the particular placement (fourth creative), for example. A single message may thus be in a plurality of impressions, each of which has a different creative for the message.


Impressions available for serving from the impressions server 340 may be stored in the impressions database 344. Impressions database 344 may comprise a commercially-available database program, such as those available from the Oracle Corporation of Redwood Shores, California. The impressions in the impressions database 344 may be assigned to be displayed only in specific web pages identified by placement ID. For example, an impression for a vacations advertisement may be contracted to be displayed to a web page in a first website, all web pages in a second website, and so on. In that case, the impression as stored in the impression database 344 may have a corresponding entry indicating the placement IDs of placements 334 where the impression may be displayed.


The impressions manager 342 may comprise computer-readable program code for selecting an impression among a plurality of available impressions and serving that impression to a requesting client computer 320. In one embodiment, the impressions manager 342 selects from a plurality of impressions available from the impressions database 344. The impressions manager 342 may select what it deems as the optimum impression for a particular placement. The optimum impression for a particular placement may be the one that generates or is likely to generate the most revenue when displayed in that particular placement. As can be appreciated, advertisers may pay advertising fees based on a number of impressions that have been served to client computers. For example, an advertiser may pay the operator of the impressions server 340 a particular amount for every thousand impressions served by the impressions server 340 to client computers 320. In selecting the optimum impression for a particular placement, the impressions server 340 may analyze data indicative of the number of times impressions have been served to client computers on the Internet and how much revenue the impressions generate.



FIG. 4 shows a flow diagram of an example impression serving process in the computing environment 300 in accordance with an embodiment of the present invention. In the example of FIG. 4, the behavior monitor 324 monitors the websites visited by the end-user on the client computer 320 and stores or facilitates storage of the categories of those websites in the cookie 326. For example, if the end-user has previously viewed web pages relating to power tools and car rentals, the cookie 326 would contain encrypted or unencrypted data in the cookie 326 indicating the categories “power tools” and “car rentals.” When the web browser 322 is pointed to receive the web page 332, the web server 330 provides the web page 332 to the client computer 320 for display in the web browser 322 (arrow 451). Upon receipt in the client computer 320, computer-readable program code in the web page 332 associated with the placement 334 sends a request for impression and the cookie 326 to the impressions manager 342 of the impressions server 340.(arrow 452). The request for impression may include the placement ID of the placement 334. The impressions manager 342 receives the request and, based on data in the cookie 326 and the placement 334 (as identified by its placement ID), selects an impression to be displayed in the placement 334. The impressions manager 342 may select the impression from among the plurality of impression in the impressions database 344 then serve the selected impression to the client computer 320 (arrow 453). In the client computer 320, the selected impression is displayed in the placement 334 of the web page 332.



FIG. 5 schematically shows the components of an impressions manager 342 in accordance with an embodiment of the present invention. In the example of FIG. 5, the impressions manager 342 comprises a personalization module 504, a business rule enforcer 506, and an optimizer 508. In one embodiment, the impressions manager 342 receives behavioral data 501 and a placement ID 502 as inputs and determines a selected impression 510 as an output. The behavioral data 501 may comprise information indicative of an end-user's preference based on monitoring of the end-user's online behavior. In one embodiment, the behavioral data 501 indicate the categories of websites previously visited by the end-user. The behavioral data 501 may also indicate the impressions already displayed in the client computer 320 and whether or not the end-user interacted with the impressions. The behavioral data 501 may contain the client computer ID of the client computer 320 for identification purposes. The behavioral data 501 may be stored in a cookie 326, which the impressions server 340 receives from the end-user's client computer 320.


Generally speaking, a placement is a location in a web page of a website in which an impression is to be displayed. The placement ID 502 identifies a particular placement 334. The placement ID 502 thus allows the impressions manager 342 to identify the website serving the web page that contains the placement. Identifying the website not only facilitates accounting how many times an impression has been served to a web page of the website for billing purposes, but also advantageously helps in determining the best performing impression to serve to the web page based on revenue.


The personalization module 504 may comprise computer-readable program code for determining a list of impressions suitable for display in a particular placement. In the example of FIG. 5, the personalization module 504 receives the behavioral data 501 and the placement ID as input. In one embodiment, the personalization module goes through available impressions in the impressions database 344 and generates a list of impressions related to the same categories of websites indicated in the behavioral data 501 and may be displayed in the particular placement identified by the placement ID 502. The personalization module 504 advantageously allows for selection of impressions most likely to be of interest to the end-user as it finds impressions in the same categories as the websites previously visited by the end-user.


The business rule enforcer 506 may comprise computer-readable program code for determining which of the suitable impressions found by the personalization module 504 complies with business rules designed to further increase the likelihood that the end-user will be interested in the impressions. In one embodiment, the business rule enforcer reads the impression IDs and the client computer ID in the behavioral data 501 to find impressions that have already been displayed in the client computer 320. The business rule enforcer 506 may filter out (i.e. remove) those impressions from the list of suitable impressions. The business rule enforcer 506 may also filter out impressions belonging to a category that the end-user has not expressed interest in (e.g. did not interact with impressions in that category). The business rule enforcer may also enforce additional or other rules to the list of suitable impressions without detracting from the merits of the present invention.


The optimizer 508 may comprise computer-readable program code for selecting an optimum impression among a plurality of suitable impressions. In one embodiment, the optimizer 508 selects the optimum impression from the filtered set of suitable impressions generated by the business rule enforcer 506. The optimizer 508 may also select the optimum impression from the list of suitable impressions found by the personalization module 504 in cases where the business rule enforcer 506 is not employed. In one embodiment, the optimizer 508 selects the optimum impression based on revenue generation. That is, the optimizer 508 may select as optimum an impression that results in the most revenue when displayed in the client computer 320. Of course, the teachings of the present disclosure may also be adapted to use factors other than revenue without detracting from the merits of the present invention. The optimum impression selected by the optimizer 508 is shown in FIG. 5 as selected impression 510.


In one embodiment, the optimizer 508 groups impressions according to learning modes. A learning mode is indicative of the amount of data available for a given impression. In one embodiment, a learning mode is a measure of the number of times a given impression has been served to web pages across the Internet.


In one embodiment, an impression that has been served less than or equal to a first predetermined threshold number of times X in a particular placement or any placement is in “non-scaled” mode. Non-scaled is a pure learning mode as it means the impression has not been served enough times to provide reliable data about its performance.


In one embodiment, an impression that has been served greater than or equal to a second predetermined threshold number of times Y in any placement, where Y>X, is in “globally scaled” mode. An impression that is in globally scaled mode has enough data to allow for reasonably reliable determination of how the impression performs on a global basis (not in any particular placement).


In one embodiment, an impression that has been served greater than or equal to a third predetermined threshold number of times Z in a particular placement, where Z>Y, is in “fully scaled” mode. An impression that is in fully scaled mode has enough data to allow for reasonably reliable determination of how the impression performs on a particular placement (as opposed to placements in general). That is, an impression in fully scaled mode has been displayed enough times in a particular placement to provide reasonably reliable information about its performance in that placement. An impression that satisfies both the requirements for globally scaled and fully scaled modes may be deemed to be in fully scaled mode. The values of X, Y, and Z may vary depending on the application. The optimizer 508 may keep track of the number of times a particular impression has been served and to which web page to allow the optimizer 508 to determine the learning mode of the impression.


For each particular impression, the optimizer 508 may keep track of the revenue generated by displaying the impression in a particular placement (as identified by placement ID) and the learning mode of the impression. An example look up table accessible to the optimizer 508 for keeping track of impression data is shown in Table 1.












TABLE 1







Revenue



Impression ID

per thousand



(Message/Creative)
Placement ID
(RPM)
Learning Mode







2001
10001
$1.75
Non-scaled


2002
10001
$2.50
Fully Scaled


2003
10001
$1.99
Globally Scaled


. . .
. . .
. . .
. . .


. . .
. . .
. . .
. . .


2051
10002
$4.60
Non-scaled


2052
10002
$1.25
Non-scaled


2053
10002
$3.34
Globally scaled


. . .
. . .
. . .
. . .


. . .
. . .
. . .
. . .


2094
10003
$2.30
Fully Scaled


2095
10003
$2.50
Fully Scaled


2096
10003
$1.25
Fully Scaled


. . .
. . .
. . .
. . .


. . .
. . .
. . .
. . .









In the example of Table 1, an impression ID identifies a particular message-creative combination forming an impression. The RPM column indicates the amount of revenue generated by displaying the impression in a particular placement in a web page. For example, the impression associated with impression ID 2001 generates $1.75 every thousand times it is displayed in the placement having the placement ID 10001. The learning mode column indicates the learning mode of the impression. In the example of Table 1, an impression having the impression ID of 2001, 2002, or 2003 may be displayed in a placement having a placement ID of 10001, an impression having the impression ID of 2051, 2052, or 2053 may be displayed in a placement having a placement ID of 10002, and so on. The optimizer 508 may employ data similar to that in Table 1 in selecting an optimum impression.



FIG. 6 shows a flow diagram of a method 600 of selecting an impression among a plurality of candidate impressions that may be displayed in a placement of a web page. The candidate impressions may be those in the list of suitable impressions found by the personalization module 504 or from the filtered set of suitable impressions found by the business rule enforcer 506, for example. The method 600 may also be performed by other components without detracting from the merits of the present invention.


In block 602, the optimizer 508 detects the learning modes of the candidate impressions. The optimizer 508 may consult a table (e.g. Table 1) or a database to determine the learning mode of each of the candidate impressions.


Block 603 follows from block 602 when all of the candidate impressions are in non-scaled mode. In that case, in block 604, the optimum impression is randomly selected from the candidate impressions.


Block 605 follows from block 602 when all of the candidate impressions are in globally scaled mode. In that case, in block 606, the optimum impression is the globally scaled impression that generates the highest revenue among the candidate impressions.


Block 607 follows from block 602 when all of the candidate impressions are in fully scaled mode. In that case, in block 608, the optimum impression is the fully scaled impression that generates the highest revenue among the candidate impressions.


Blocks 609, 610, 611, and 612 follow from block 602 when the candidate impressions have different learning modes. In block 609, the candidate impressions consist only of impressions that are in non-scaled mode, impressions that are in globally scaled mode, and impressions that are in fully scaled mode. In block 610, the candidate impressions consist only of impressions that are in non-scaled mode and impressions that are in globally scaled mode. In block 611, the candidate impressions consist only of impressions that are in non-scaled mode and impressions that are in fully scaled mode. In block 612, the candidate impressions consist only of impressions that are in globally scaled mode and impressions that are in fully scaled mode.


In the case of blocks 609, 610, 611, and 612, the optimizer 508 generates a random number and applies learning mode percentages to determine which of the learning modes will be retained for further selection. Candidate impressions that are not in the learning mode that has been retained will be removed from further consideration. For example, if fully scaled mode has been retained for further selection, the optimum impression will be selected from candidate impressions that are in fully scaled mode. In that example, impressions that are in non-scaled or globally scaled mode will not be included in the selection of the optimum impression.


The learning percentages may be based on the number of candidate impressions in each of the learning modes. That is, the retained learning mode may be randomly chosen from among the learning modes with the probability scaled or adjusted according to the number of impressions in each of the learning modes. For example, if 60% of the candidate impressions are in non-scaled mode and 40% of the candidate impressions are in globally scaled mode, 100 integer numbers (“tickets”) may be allocated with 60 of the numbers being assigned to non-scaled and 40 of the numbers being assigned to globally scaled. A random number is then generated to pick from the 100 integer numbers to determine which one of the learning modes (non-scaled or globally scaled in this example) will be retained. If non-scaled is selected, candidate impressions that are in non-scaled mode will be retained for further selection and the other candidate impressions (globally scaled in this example) are removed from consideration. If globally scaled is selected, candidate impressions that are in globally scaled mode will be retained for further selection and the other candidate impressions (non-scaled in this example) are removed from consideration. The procedure is similar for other combinations of learning modes.


Block 614 follows from block 613 when non-scaled mode is retained for further selection. In that case, in block 615, the optimum impression is randomly selected from among non-scaled impressions in the candidate impressions.


Block 616 follows from block 613 when globally scaled mode has been retained for further selection. In that case, in block 617, the optimum impression is the highest revenue generating globally scaled impression in the candidate impressions.


Block 618 follows from block 613 when fully scaled mode has been retained for further selection. In that case, in block 619, the optimum impression is the highest revenue generating fully scaled impression in the candidate impressions.


The optimum impression selected in blocks 615, 617, or 619 may be the selected impression 510 shown in the example of FIG. 5.



FIG. 7 shows a flow diagram of a method 700 of displaying an impression in a web page in accordance with an embodiment of the present invention. Method 700 may be, but not necessarily, performed in the computing environment 300 (FIG. 3). Method 700 may also be performed in other computing environments without detracting from the merits of the present invention.


In step 702, an impressions server receives a request for an impression to be displayed in a placement of a web page. The request for the impression may be provided by the client computer to the impressions server as a result of receiving the web page in the client computer.


In step 704, the impressions server receives from the client computer a placement identifier particularly identifying the placement. The placement identifier may comprise an HTML tag embedded in the web page, for example.


In step 706, the impressions server receives behavioral data from the client computer. The behavioral data may be stored in a cookie forwarded from the client computer to the impressions server. The behavioral data may be indicative of websites previously visited by an end user on the client computer and impressions previously received in the client computer. For example, the behavioral data may include categories of websites previously visited by the end user and a listing of impressions (e.g. advertisements) previously served to web pages in the client computer.


In step 708, the impressions server determines a set of candidate impressions that may be displayed in the placement. The candidate impressions may be determined based on the behavioral data and the placement identifier. For example, the candidate impressions may comprise impressions specifically designated to be displayed in a placement having the same placement identifier as that received from the client computer. As another example, the candidate impressions may comprise impressions that are related to a category of websites that is noted in the behavioral data.


In step 710, the impressions server determines the learning mode of each of the candidate impressions. A learning mode may be indicative of a number of times an impression has been served to web pages in client computers on the Internet.


In step 712, the impressions server selects a selected impression from the candidate impressions. The selected impression may be selected based on the learning mode and revenue generation capability of each of the candidate impressions.


In step 714, the selected impression is displayed in the placement of the web page.


Improved techniques for displaying impressions in documents delivered over a computer network have been disclosed. While specific embodiments of the present invention have been provided, it is to be understood that these embodiments are for illustration purposes and not limiting. Many additional embodiments will be apparent to persons of ordinary skill in the art reading this disclosure.

Claims
  • 1. A method comprising: (A) receiving, from a client computer, a request for an impression to be displayed in a placement of a web page, the request being made by the client computer as a result of said client computer receiving the web page;(B) receiving from the client computer a placement identifier particularly identifying a placement for the impression in the web page, the placement identifier having been embedded in the web page received at the client computer;(C) receiving behavioral data from the client computer, the behavioral data being indicative of client actions taken on multiple websites previously visited by the client computer and indicative of impressions previously received at the client computer;(D) determining a plurality of candidate impressions that may be displayed in the placement of the web page, based, at least in part, on the behavioral data;(E) determining a learning mode of each impression in the plurality of candidate impressions, the learning mode of each said impression being indicative of a number of times said each impression in the plurality of candidate impressions has been served to web pages in client computers on the Internet,wherein said learning mode is one of a plurality of learning modes, said plurality of learning modes comprising at least a first learning mode, a second learning mode, and a third learning mode,wherein, impressions that have been served less than a first predetermined threshold number of times are in said first learning mode, andwherein impressions that have been served more than said first predetermined number of times and less than a second predetermined threshold number of times are in said second learning mode, andwherein impressions that have been served more than a third predetermined threshold number of times are in a third learning mode, said second predetermined threshold being greater than said first predetermined threshold, and said third predetermined threshold being greater than said second predetermined threshold;(F) selecting a selected impression from the plurality of candidate impressions based at least in part on the learning mode of each of the impressions; and(G) serving the selected impression to the client computer,wherein selecting the selected impression from the plurality of candidate impressions in (F) comprises: (f1) if all impressions in the plurality of candidate impressions are in said first learning mode, then randomly selecting the selected impression from the plurality of candidate impressions; and(f2) if all impressions in the plurality of candidate impressions are in said second learning mode, then selecting a highest revenue generating impression in the plurality of candidate impressions as the selected impression; and(f3) if all of the impressions in the plurality of candidate impressions are in said third learning mode, then selecting a highest revenue generating impression in the plurality of candidate impressions as the selected impression; and(f4) if at least some impressions in the plurality of candidate impressions are in different learning modes, then selecting, as a final set of candidate impressions, impressions in the plurality of candidate impressions that are either; (i) all in the first learning mode, or (ii) all in the second learning mode, or (iii) all in the third learning mode, and then selecting the selected impression from the final set of candidate impressions.
  • 2. The method of claim 1 wherein determining the plurality of candidate impressions in (D) comprises: using at least the behavioral data and the placement identifier to determine a first set of impressions that may be displayed in the web page;generating a second set of impressions from the first set of impressions by applying business rules to the first set of impressions, the business rules being designed to increase a likelihood that the end-user will be interested in impressions in the second set of impressions.
  • 3. The method of claim 2 wherein the business rules include a rule that impressions previously displayed in the client computer are not included in the second set of impressions.
  • 4. The method of claim 1 wherein the placement identifier comprises a hypertext markup language (HTML) tag.
  • 5. The method of claim 1 wherein each impression in the plurality of candidate impressions comprises a message and an associated creative, the creative being a design of how the message is to be presented to the end-user.
  • 6. The method of claim 5 wherein the plurality of candidate impressions comprise: a first message with an associated first creative;the first message with an associated second creative; andthe first message with an associated third creative;wherein the first, second, and third creatives are different from each other.
  • 7. The method of claim 1 wherein: said first learning mode is a non-scaled learning mode;said second learning mode is a globally scaled learning mode; andsaid third learning mode is a fully scaled learning mode.
  • 8. The method of claim 1 wherein the behavioral data are received in a cookie.
  • 9. The method of claim 1 wherein the placement identifier is received as part of the request.
  • 10. The method of claim 1 wherein selecting the selected impression from the final set of candidate impressions in (f4) comprises: if all impressions in the final set of candidate impressions are in the first learning mode, then randomly selecting the selected impression from the final set of candidate impressions; andif all impressions in the final set of candidate impressions are in the second learning mode or the third learning mode, then selecting a highest revenue generating impression in the final set of candidate impressions as the selected impression.
  • 11. The method of claim 10 wherein selecting the selected impression from the final set of candidate impressions comprises: if all impressions in the final set of candidate impressions are in the first learning mode, then randomly selecting the selected impression from the final set of candidate impressions; andif all impressions in the final set of candidate impressions are in the second learning mode or the third learning mode, then selecting a highest revenue generating impression in the final set of candidate impressions as the selected impression.
  • 12. A system for serving an impression to a web page, the system comprising: an impressions server computer configured(A) to receive from a client computer: (i) a request for an impression to be displayed in a placement of a web page on the client computer, the request being provided by the client computer as a result of said client computer receiving the web page,(ii) a placement identifier particularly identifying the placement of the impression in the web page, the placement identifier having been embedded in the web page received at the client computer, and(iii) behavioral data comprising information indicative of client actions taken on multiple websites previously visited by an end-user of the client computer and information indicative of impressions previously displayed on the client computer;(B) to select a set of candidate impressions from a set of impressions using at least the behavioral data and the placement identifier, wherein each impression in the set of candidate impressions has a corresponding learning mode associated therewith, the learning mode of each said impression being indicative of a number of times said each impression has been served to web pages on the Internet,wherein said learning mode is one of a plurality of learning modes, said plurality of learning modes comprising a first learning mode, a second learning mode, and a third learning mode,wherein, impressions that have been served less than a first predetermined threshold number of times are in said first learning mode, andwherein impressions that have been served more than said first predetermined number of times and less than a second predetermined threshold number of times are in said second learning mode, andwherein impressions that have been served more than a third predetermined threshold number of times are in a third learning mode, said third predetermined threshold being greater than said second predetermined threshold; and then(C) to select a selected impression based at least in part on a learning mode of each impression in the set of candidate impressions, by: (c1) if all impressions in the set of candidate impressions are in the first learning mode, then the impressions server computer is configured to randomly select the selected impression from the set of candidate impressions; and(c2) if all impressions in the set of candidate impressions are in the second learning mode, then the impressions server computer is configured to select a highest revenue generating impression in the set of candidate impressions as the selected impression; and(c3) if all impressions in the set of candidate impressions are in the third learning mode, then the impressions server computer is configured to select a highest revenue generating impression in the plurality of candidate impressions as the selected impression; and(c4) if at least some impressions in the set of candidate impressions are in different learning modes, then the impressions server computer is configured to select impressions in the set of candidate impressions that are either in the first learning mode, or the second learning mode, or the third learning mode to be in a final set of candidate impressions, and then to select the selected impression from the final set of candidate impressions; and(D) to forward the selected impression to the client computer for display in the placement of the web page.
  • 13. The system of claim 12 wherein the behavioral data are stored in a cookie received by the impressions server computer from the client computer.
  • 14. The system of claim 13 wherein the client computer comprises: a behavior monitor comprising computer-readable program code for monitoring online-activities of the end-user, the behavior monitor being configured to facilitate storage in the cookie categories of websites visited by the end-user.
  • 15. A method comprising: (A) receiving from a client computer a request for an impression to be displayed in a placement of a web page in the client computer, the request being provided by the client computer as a result of said client computer receiving the web page;(B) receiving a cookie from the client computer, the cookie comprising data including behavioral data indicative of categories of websites previously visited by an end-user on the client computer; and(C) using at least the behavioral data to select a selected impression from a plurality of candidate impressions that may be displayed in the placement of the web page, the selected impression being selected from the plurality of candidate impressions based at least in part on anticipated revenue generation,wherein selecting the selected impression from the plurality of candidate impressions comprises: (c1) if all impressions in the plurality of candidate impressions are in a first learning mode, then randomly selecting the selected impression from the plurality of candidate impressions; and,(c2) if all impressions in the plurality of candidate impressions are in a second learning mode, then selecting a highest revenue generating impression in the plurality of candidate impressions as the selected impression; and,(c3) if all of the impressions in the plurality of candidate impressions are in a third learning mode, then selecting a highest revenue generating impression in the plurality of candidate impressions as the selected impressionwherein impressions in the first learning mode comprise impressions that have been served less than a first predetermined threshold number of times, andwherein impressions in the second learning mode comprise impressions that have been served more than said first predetermined number of times and less than a second predetermined threshold number of times, andwherein impressions in the third learning mode comprise impressions that have been served more than a third predetermined threshold number of times, said third predetermined threshold being greater than said second predetermined threshold.
  • 16. The method of claim 15 further comprising: receiving a placement identifier particularly identifying the placement.
  • 17. The method of claim 15 wherein the plurality of candidate impressions comprise: a first message with an associated first creative;the first message with an associated second creative; andthe first message with an associated third creative;
  • 18. The method of claim 15 wherein selecting the selected impression from the plurality of candidate impressions comprises further comprises: (c4) if at least some impressions in the plurality of candidate impressions are in different learning modes, then selecting, as a final set of candidate impressions, impressions in the plurality of candidate impressions that are either (i) all in the first learning mode, or (ii) all the second learning mode, or (iii) all in the third learning mode, and then selecting the selected impression from the final set of candidate impressions.
  • 19. The method of claim 15 wherein each impression in the plurality of candidate impressions comprises a message and an associated creative, the creative being a design of how the message is to be presented to the end-user.
  • 20. The method of claim 15 wherein: said first learning mode is a non-scaled learning mode;said second learning mode is a globally scaled learning mode; andsaid third learning mode is a fully scaled learning mode.
CROSS-REFERENCE TO RELATED APPLICATION

This application claims the benefit of U.S. Provisional Application No. 60/694,533, filed on Jun. 28, 2005.

US Referenced Citations (784)
Number Name Date Kind
4455083 Elmes Jun 1984 A
4575579 Simon et al. Mar 1986 A
4719567 Whittington et al. Jan 1988 A
4775935 Yourick Oct 1988 A
4782449 Brinker et al. Nov 1988 A
4799146 Chauvel Jan 1989 A
4850007 Marino et al. Jul 1989 A
4977594 Shear Dec 1990 A
5027400 Baji et al. Jun 1991 A
5029104 Dodson et al. Jul 1991 A
5093718 Hoarty et al. Mar 1992 A
5099420 Barlow et al. Mar 1992 A
5105184 Pirani et al. Apr 1992 A
5159669 Trigg et al. Oct 1992 A
5165012 Crandall et al. Nov 1992 A
5196838 Meier et al. Mar 1993 A
5202961 Mills et al. Apr 1993 A
5220420 Hoarty et al. Jun 1993 A
5220516 Dodson et al. Jun 1993 A
5220564 Tuch et al. Jun 1993 A
5231499 Trytko Jul 1993 A
5247517 Ross et al. Sep 1993 A
5253341 Rozmanith et al. Oct 1993 A
5268963 Monroe et al. Dec 1993 A
5283639 Esch et al. Feb 1994 A
5283731 Lalonde et al. Feb 1994 A
5285442 Iwamura et al. Feb 1994 A
5297249 Bernstein et al. Mar 1994 A
5305195 Murphy Apr 1994 A
5307456 MacKay Apr 1994 A
5313455 van der Wal et al. May 1994 A
5315580 Phaal May 1994 A
5319455 Hoarty et al. Jun 1994 A
5321740 Gregorek et al. Jun 1994 A
5325423 Lewis Jun 1994 A
5325483 Ise et al. Jun 1994 A
5327554 Palazzi et al. Jul 1994 A
5333237 Stefanopoulos et al. Jul 1994 A
5347632 Filepp et al. Sep 1994 A
5355472 Lewis Oct 1994 A
5355501 Gross et al. Oct 1994 A
5361091 Hoarty et al. Nov 1994 A
5361199 Shoquist et al. Nov 1994 A
5361393 Rossillo Nov 1994 A
5367621 Cohen et al. Nov 1994 A
5373375 Weldy Dec 1994 A
5392447 Schlack et al. Feb 1995 A
5412720 Hoarty May 1995 A
5418549 Anderson et al. May 1995 A
5438518 Bianco et al. Aug 1995 A
5442771 Filepp et al. Aug 1995 A
5446919 Wilkins Aug 1995 A
5469553 Patrick Nov 1995 A
5481741 McKaskle et al. Jan 1996 A
5483466 Kawahara et al. Jan 1996 A
5491785 Robson et al. Feb 1996 A
5499340 Barritz Mar 1996 A
5500890 Rogge et al. Mar 1996 A
5515098 Carles May 1996 A
5515270 Weinblatt May 1996 A
5515490 Buchanan et al. May 1996 A
5517612 Dwin et al. May 1996 A
5524195 Clanton, III et al. Jun 1996 A
5524197 Uya et al. Jun 1996 A
5530472 Bregman et al. Jun 1996 A
5530759 Braudaway et al. Jun 1996 A
5530852 Meske et al. Jun 1996 A
5532735 Blahut et al. Jul 1996 A
5541986 Hou Jul 1996 A
5544302 Nguyen Aug 1996 A
5544320 Konrad Aug 1996 A
5548745 Egan et al. Aug 1996 A
5563804 Mortensen et al. Oct 1996 A
5564043 Siefert Oct 1996 A
5572643 Judson Nov 1996 A
5579381 Courville et al. Nov 1996 A
5583560 Florin et al. Dec 1996 A
5583763 Atcheson et al. Dec 1996 A
5584025 Keithley et al. Dec 1996 A
5590046 Anderson et al. Dec 1996 A
5594509 Florin et al. Jan 1997 A
5594779 Goodman Jan 1997 A
5596718 Boebert et al. Jan 1997 A
5602905 Mettke Feb 1997 A
5604542 Dedrick Feb 1997 A
5606359 Youden et al. Feb 1997 A
5608850 Robertson Mar 1997 A
5615131 Mortensen et al. Mar 1997 A
5615325 Peden Mar 1997 A
5617526 Oran et al. Apr 1997 A
5621456 Florin et al. Apr 1997 A
5627886 Bowman May 1997 A
5629978 Blumhardt et al. May 1997 A
5630081 Rybicki et al. May 1997 A
5635979 Kostreski et al. Jun 1997 A
5638443 Stefik et al. Jun 1997 A
5642484 Harrison, III et al. Jun 1997 A
5649186 Ferguson Jul 1997 A
5657450 Rao et al. Aug 1997 A
5664948 Dimitriadis et al. Sep 1997 A
5673322 Pepe et al. Sep 1997 A
5675510 Coffey et al. Oct 1997 A
5680562 Conrad et al. Oct 1997 A
5682525 Bouve et al. Oct 1997 A
5684715 Palmer Nov 1997 A
5684969 Ishida Nov 1997 A
5701451 Rogers et al. Dec 1997 A
5704017 Heckerman et al. Dec 1997 A
5706434 Kremen et al. Jan 1998 A
5706502 Foley et al. Jan 1998 A
5708709 Rose Jan 1998 A
5708780 Levergood et al. Jan 1998 A
5710884 Dedrick Jan 1998 A
5710918 Lagarde et al. Jan 1998 A
5712979 Graber et al. Jan 1998 A
5715453 Stewart Feb 1998 A
5717860 Graber et al. Feb 1998 A
5717923 Dedrick Feb 1998 A
5721827 Logan et al. Feb 1998 A
5721908 Lagarde et al. Feb 1998 A
5724521 Dedrick Mar 1998 A
5724556 Souder et al. Mar 1998 A
5724567 Rose et al. Mar 1998 A
5727129 Barrett et al. Mar 1998 A
5727159 Kikinis Mar 1998 A
5734863 Kodosky et al. Mar 1998 A
5737619 Judson Apr 1998 A
5737739 Shirley et al. Apr 1998 A
5740252 Minor et al. Apr 1998 A
5740549 Reilly et al. Apr 1998 A
5742768 Gennaro et al. Apr 1998 A
5742905 Pepe et al. Apr 1998 A
5745681 Levine et al. Apr 1998 A
5751956 Kirsch May 1998 A
5754830 Butts et al. May 1998 A
5754938 Herz et al. May 1998 A
5754939 Herz et al. May 1998 A
5758111 Shiratori et al. May 1998 A
5758257 Herz et al. May 1998 A
5760767 Shore et al. Jun 1998 A
5761601 Nemirofsky et al. Jun 1998 A
5761662 Dasan Jun 1998 A
5768508 Eikeland Jun 1998 A
5768510 Gish Jun 1998 A
5781894 Petrecca et al. Jul 1998 A
5787253 McCreery et al. Jul 1998 A
5787254 Maddalozzo, Jr. et al. Jul 1998 A
5793972 Shane Aug 1998 A
5794210 Goldhaber et al. Aug 1998 A
5794259 Kikinis Aug 1998 A
5796952 Davis et al. Aug 1998 A
5801685 Miller et al. Sep 1998 A
5802320 Baehr et al. Sep 1998 A
5805735 Chen et al. Sep 1998 A
5805815 Hill Sep 1998 A
5809242 Shaw et al. Sep 1998 A
5809481 Baron et al. Sep 1998 A
5809512 Kato Sep 1998 A
5812642 Leroy Sep 1998 A
5812769 Graber et al. Sep 1998 A
5819047 Bauer et al. Oct 1998 A
5819092 Ferguson et al. Oct 1998 A
5822526 Waskiewicz Oct 1998 A
5832502 Durham et al. Nov 1998 A
5835087 Herz et al. Nov 1998 A
5835092 Boudreau et al. Nov 1998 A
5835722 Bradshaw et al. Nov 1998 A
5838458 Tsai Nov 1998 A
5848246 Gish Dec 1998 A
5848396 Gerace Dec 1998 A
5848397 Marsh et al. Dec 1998 A
5850352 Moezzi et al. Dec 1998 A
5850433 Rondeua Dec 1998 A
5854897 Guyot et al. Dec 1998 A
5855008 Goldhaber et al. Dec 1998 A
5861880 Shimizu et al. Jan 1999 A
5861883 Cuomo et al. Jan 1999 A
5862260 Rhoads Jan 1999 A
5862325 Reed et al. Jan 1999 A
5864823 Levitan Jan 1999 A
5870769 Freund Feb 1999 A
5872850 Klein et al. Feb 1999 A
5875296 Shi et al. Feb 1999 A
5877766 Bates et al. Mar 1999 A
5878231 Baehr et al. Mar 1999 A
5883955 Ronning Mar 1999 A
5884025 Baehr et al. Mar 1999 A
5886683 Tognazzini et al. Mar 1999 A
5887133 Brown et al. Mar 1999 A
5890152 Rapaport et al. Mar 1999 A
5892917 Myerson Apr 1999 A
5893053 Trueblood Apr 1999 A
5893118 Sonderegger Apr 1999 A
5894554 Lowery et al. Apr 1999 A
5897622 Blinn et al. Apr 1999 A
5898434 Small et al. Apr 1999 A
5901287 Bull et al. May 1999 A
5903892 Hoffert et al. May 1999 A
5905492 Straub et al. May 1999 A
5905800 Moskowitz et al. May 1999 A
5907838 Miyasaka et al. May 1999 A
5913040 Rakavy et al. Jun 1999 A
5918012 Astiz et al. Jun 1999 A
5918013 Mighdoll et al. Jun 1999 A
5918014 Robinson Jun 1999 A
5918214 Perkowski Jun 1999 A
5920697 Masters et al. Jul 1999 A
5923845 Kamiya et al. Jul 1999 A
5923853 Danneels Jul 1999 A
5929850 Broadwin et al. Jul 1999 A
5930446 Kanda Jul 1999 A
5930700 Pepper et al. Jul 1999 A
5930801 Falkenhainer et al. Jul 1999 A
5931901 Wolfe et al. Aug 1999 A
5931907 Davies et al. Aug 1999 A
5933811 Angles et al. Aug 1999 A
5933832 Suzuoka et al. Aug 1999 A
5936679 Kasahara et al. Aug 1999 A
5937037 Kamel et al. Aug 1999 A
5937390 Hyodo Aug 1999 A
5937392 Alberts Aug 1999 A
5937411 Becker Aug 1999 A
5943478 Aggarwal et al. Aug 1999 A
5944791 Scherpbier Aug 1999 A
5946646 Schena et al. Aug 1999 A
5946664 Ebisawa Aug 1999 A
5946697 Shen Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5951300 Brown Sep 1999 A
5956693 Geerlings Sep 1999 A
5956716 Kenner et al. Sep 1999 A
5958008 Pogrebisky et al. Sep 1999 A
5958015 Dascalu Sep 1999 A
5959621 Nawaz et al. Sep 1999 A
5959623 Van Hoff et al. Sep 1999 A
5960409 Wexler Sep 1999 A
5961593 Gabber et al. Oct 1999 A
5961602 Thompson et al. Oct 1999 A
5961603 Kunkel et al. Oct 1999 A
5963909 Warren et al. Oct 1999 A
5963915 Kirsch Oct 1999 A
5966121 Hubbell et al. Oct 1999 A
5970473 Gerszber et al. Oct 1999 A
5974219 Fujita et al. Oct 1999 A
5974451 Simmons Oct 1999 A
5978807 Mano et al. Nov 1999 A
5978833 Pashley et al. Nov 1999 A
5978836 Ouchi Nov 1999 A
5978841 Berger Nov 1999 A
5978842 Noble et al. Nov 1999 A
5983227 Nazem et al. Nov 1999 A
5983244 Nation Nov 1999 A
5983268 Freivald et al. Nov 1999 A
5987466 Greer et al. Nov 1999 A
5987606 Cirasole et al. Nov 1999 A
5991735 Gerace Nov 1999 A
5991799 Yen et al. Nov 1999 A
5995597 Woltz et al. Nov 1999 A
5995943 Bull et al. Nov 1999 A
5996007 Klug et al. Nov 1999 A
5996011 Humes Nov 1999 A
5999526 Garland et al. Dec 1999 A
5999731 Yellin et al. Dec 1999 A
5999740 Rowley Dec 1999 A
5999912 Wodarz et al. Dec 1999 A
6002401 Baker Dec 1999 A
6006241 Purnaveja et al. Dec 1999 A
6006252 Wolfe Dec 1999 A
6006265 Rangan et al. Dec 1999 A
6009236 Mishima et al. Dec 1999 A
6009409 Adler et al. Dec 1999 A
6009410 LeMole et al. Dec 1999 A
6011537 Slotznick Jan 2000 A
6012083 Savitzky et al. Jan 2000 A
6014502 Moraes Jan 2000 A
6014638 Burge et al. Jan 2000 A
6014698 Griffiths Jan 2000 A
6014711 Brown Jan 2000 A
6016509 Dedrick Jan 2000 A
6020884 MacNaughton et al. Feb 2000 A
6023726 Saksena Feb 2000 A
6025837 Matthew, III et al. Feb 2000 A
6025886 Koda Feb 2000 A
6026368 Brown et al. Feb 2000 A
6026413 Challenger et al. Feb 2000 A
6026433 D'arlach et al. Feb 2000 A
6026933 King et al. Feb 2000 A
6029045 Picco et al. Feb 2000 A
6029141 Bezos et al. Feb 2000 A
6029145 Barritz Feb 2000 A
6029182 Nehab et al. Feb 2000 A
6029195 Herz Feb 2000 A
6035332 Ingrassia, Jr. et al. Mar 2000 A
6047318 Becker et al. Apr 2000 A
6047327 Tso et al. Apr 2000 A
6049821 Theriault et al. Apr 2000 A
6052709 Paul Apr 2000 A
6052717 Reynolds et al. Apr 2000 A
6052730 Felciano et al. Apr 2000 A
6055572 Saksena Apr 2000 A
6058141 Barger et al. May 2000 A
6061054 Jolly May 2000 A
6061659 Murray May 2000 A
6061716 Moncreiff May 2000 A
6065024 Renshaw May 2000 A
6065056 Bradshaw et al. May 2000 A
6067559 Allard et al. May 2000 A
6067561 Dillon May 2000 A
6067565 Horvitz May 2000 A
6070140 Tran May 2000 A
6073105 Sutcliffe et al. Jun 2000 A
6073167 Poulton et al. Jun 2000 A
6073241 Rosenberg et al. Jun 2000 A
6076166 Moshfeghi et al. Jun 2000 A
6078916 Culliss Jun 2000 A
6081840 Zhao Jun 2000 A
6084581 Hunt Jul 2000 A
6085193 Malkin et al. Jul 2000 A
6085226 Horvitz Jul 2000 A
6085242 Chandra Jul 2000 A
6088731 Kiraly et al. Jul 2000 A
6091411 Straub et al. Jul 2000 A
6092196 Reiche Jul 2000 A
6094655 Rogers et al. Jul 2000 A
6094677 Capek et al. Jul 2000 A
6098064 Pirolli et al. Aug 2000 A
6098065 Skillen et al. Aug 2000 A
6101510 Stone et al. Aug 2000 A
6108637 Blumenau Aug 2000 A
6108691 Lee et al. Aug 2000 A
6108799 Boulay et al. Aug 2000 A
6112215 Kaply Aug 2000 A
6112246 Horbal et al. Aug 2000 A
6115680 Coffee et al. Sep 2000 A
6119098 Guyot et al. Sep 2000 A
6119165 Li et al. Sep 2000 A
6122632 Botts et al. Sep 2000 A
6125388 Reisman Sep 2000 A
6128655 Fields et al. Oct 2000 A
6128663 Thomas Oct 2000 A
6133912 Montero Oct 2000 A
6133918 Conrad et al. Oct 2000 A
6134380 Kushizaki Oct 2000 A
6134532 Lazarus et al. Oct 2000 A
6138146 Moon et al. Oct 2000 A
6138155 Davis et al. Oct 2000 A
6141010 Hoyle Oct 2000 A
6144944 Kurtzman, II et al. Nov 2000 A
6151596 Hosomi Nov 2000 A
6154738 Call Nov 2000 A
6154771 Rangan et al. Nov 2000 A
6157924 Austin Dec 2000 A
6157946 Itakura et al. Dec 2000 A
6161112 Cragun et al. Dec 2000 A
6163778 Fogg et al. Dec 2000 A
6167438 Yates et al. Dec 2000 A
6167453 Becker et al. Dec 2000 A
6178443 Lin Jan 2001 B1
6178461 Chan et al. Jan 2001 B1
6182066 Marques Jan 2001 B1
6182097 Hansen et al. Jan 2001 B1
6182122 Berstis Jan 2001 B1
6182133 Horvitz Jan 2001 B1
6183366 Goldberg et al. Feb 2001 B1
6185558 Bowman Feb 2001 B1
6185586 Judson Feb 2001 B1
6185614 Cuomo et al. Feb 2001 B1
6191782 Mori et al. Feb 2001 B1
6192380 Light et al. Feb 2001 B1
6195622 Altschuler et al. Feb 2001 B1
6198906 Boetje et al. Mar 2001 B1
6199079 Gupta et al. Mar 2001 B1
6202093 Bolam et al. Mar 2001 B1
6204840 Petelycky et al. Mar 2001 B1
6208339 Atlas et al. Mar 2001 B1
6216141 Straub et al. Apr 2001 B1
6216212 Challenger et al. Apr 2001 B1
6219676 Reiner Apr 2001 B1
6222520 Gerszberg et al. Apr 2001 B1
6223215 Hunt et al. Apr 2001 B1
6233564 Schulze, Jr. May 2001 B1
6237022 Bruck et al. May 2001 B1
6249284 Bogdan Jun 2001 B1
6253188 Witek et al. Jun 2001 B1
6253208 Wittgreffe et al. Jun 2001 B1
6266058 Meyer Jul 2001 B1
6269361 Davis et al. Jul 2001 B1
6275854 Himmel et al. Aug 2001 B1
6279112 O'Toole et al. Aug 2001 B1
6280043 Ohkawa Aug 2001 B1
6285987 Roth et al. Sep 2001 B1
6286043 Cuomo et al. Sep 2001 B1
6286045 Griffiths et al. Sep 2001 B1
6295061 Park et al. Sep 2001 B1
6297819 Furst Oct 2001 B1
6304844 Pan et al. Oct 2001 B1
6308202 Cohn et al. Oct 2001 B1
6311194 Sheth et al. Oct 2001 B1
6314451 Landsman et al. Nov 2001 B1
6314457 Schema et al. Nov 2001 B1
6317761 Landsman et al. Nov 2001 B1
6321209 Pasquali Nov 2001 B1
6321256 Himmel et al. Nov 2001 B1
6324553 Cragun et al. Nov 2001 B1
6324569 Ogilvie et al. Nov 2001 B1
6324583 Stevens Nov 2001 B1
6327574 Kramer et al. Dec 2001 B1
6327617 Fawcett Dec 2001 B1
6332127 Bandera Dec 2001 B1
6334111 Carrott Dec 2001 B1
6335963 Bosco Jan 2002 B1
6336131 Wolfe Jan 2002 B1
6338059 Fields et al. Jan 2002 B1
6338066 Martin et al. Jan 2002 B1
6341305 Wolfe Jan 2002 B2
6347398 Parthasarathy et al. Feb 2002 B1
6351279 Sawyer Feb 2002 B1
6351745 Itakura et al. Feb 2002 B1
6353834 Wong et al. Mar 2002 B1
6356898 Cohen et al. Mar 2002 B2
6356908 Brown et al. Mar 2002 B1
6360221 Gough et al. Mar 2002 B1
6366298 Haitsuka Apr 2002 B1
6370527 Singhal Apr 2002 B1
6377983 Cohen et al. Apr 2002 B1
6378075 Goldstein et al. Apr 2002 B1
6381735 Hunt Apr 2002 B1
6381742 Forbes et al. Apr 2002 B2
6385592 Angles et al. May 2002 B1
6392668 Murray May 2002 B1
6393407 Middleton et al. May 2002 B1
6393415 Getchius et al. May 2002 B1
6397228 Lamburt et al. May 2002 B1
6401075 Mason et al. Jun 2002 B1
6415322 Jaye Jul 2002 B1
6418440 Kuo et al. Jul 2002 B1
6418471 Shelton et al. Jul 2002 B1
6421675 Ryan et al. Jul 2002 B1
6421724 Nickerson et al. Jul 2002 B1
6421729 Paltenghe et al. Jul 2002 B1
6434745 Conley, Jr. et al. Aug 2002 B1
6437802 Kenny Aug 2002 B1
6438215 Skladman et al. Aug 2002 B1
6438578 Schmid et al. Aug 2002 B1
6438579 Hosken Aug 2002 B1
6441832 Tao et al. Aug 2002 B1
6442529 Krishan et al. Aug 2002 B1
6446128 Woods et al. Sep 2002 B1
6449657 Stanbach, Jr. et al. Sep 2002 B2
6452612 Holtz et al. Sep 2002 B1
6457009 Bollay Sep 2002 B1
6459440 Monnes et al. Oct 2002 B1
6460036 Herz Oct 2002 B1
6460042 Hitchcock et al. Oct 2002 B1
6460060 Maddalozzo et al. Oct 2002 B1
6466970 Lee et al. Oct 2002 B1
6477550 Balasubramaniam et al. Nov 2002 B1
6477575 Koeppel et al. Nov 2002 B1
6480837 Dutta Nov 2002 B1
6484148 Boyd Nov 2002 B1
6487538 Gupta et al. Nov 2002 B1
6490722 Barton et al. Dec 2002 B1
6493702 Adar et al. Dec 2002 B1
6496931 Rajchel et al. Dec 2002 B1
6499052 Hoang et al. Dec 2002 B1
6502076 Smith Dec 2002 B1
6505201 Haitsuka Jan 2003 B1
6513052 Binder Jan 2003 B1
6513060 Nixon et al. Jan 2003 B1
6516312 Kraft et al. Feb 2003 B1
6523021 Monberg et al. Feb 2003 B1
6526411 Ward Feb 2003 B1
6529903 Smith et al. Mar 2003 B2
6539375 Kawasaki Mar 2003 B2
6539424 Dutta Mar 2003 B1
6564202 Schuetze et al. May 2003 B1
6567850 Freishtat et al. May 2003 B1
6567854 Olshansky et al. May 2003 B1
6570595 Porter May 2003 B2
6572662 Manohar et al. Jun 2003 B2
6584479 Chang et al. Jun 2003 B2
6584492 Cezar et al. Jun 2003 B1
6584505 Howard et al. Jun 2003 B1
6594654 Salam et al. Jul 2003 B1
6601041 Brown et al. Jul 2003 B1
6601057 Underwood et al. Jul 2003 B1
6601100 Lee et al. Jul 2003 B2
6604103 Wolfe Aug 2003 B1
6606652 Cohn et al. Aug 2003 B1
6615247 Murphy Sep 2003 B1
6622168 Datta Sep 2003 B1
6631360 Cook Oct 2003 B1
0221167 Goldstein et al. Nov 2003 A1
6642944 Conrad et al. Nov 2003 B2
6643696 Davis et al. Nov 2003 B2
6665656 Carter Dec 2003 B1
6665838 Brown et al. Dec 2003 B1
6678731 Howard et al. Jan 2004 B1
6678866 Sugimoto et al. Jan 2004 B1
6681223 Sundaresan Jan 2004 B1
6681247 Payton Jan 2004 B1
6686931 Bodnar Feb 2004 B1
6687737 Landsman et al. Feb 2004 B2
6691106 Sathyanarayan Feb 2004 B1
6697825 Underwood et al. Feb 2004 B1
6701362 Subramonian Mar 2004 B1
6701363 Chiu et al. Mar 2004 B1
6714975 Aggarwal et al. Mar 2004 B1
6718365 Dutta Apr 2004 B1
6721741 Eyal et al. Apr 2004 B1
6721795 Eldreth Apr 2004 B1
6725269 Megiddo Apr 2004 B1
6725303 Hoguta et al. Apr 2004 B1
6741967 Wu et al. May 2004 B1
6757661 Blaser et al. Jun 2004 B1
6760746 Schneider Jul 2004 B1
6760916 Holtz et al. Jul 2004 B2
6763379 Shuster Jul 2004 B1
6763386 Davis et al. Jul 2004 B2
6771290 Hoyle Aug 2004 B1
6772200 Bakshi et al. Aug 2004 B1
6785659 Landsman et al. Aug 2004 B1
6785723 Genty et al. Aug 2004 B1
6801906 Bates et al. Oct 2004 B1
6801909 Delgado et al. Oct 2004 B2
6826534 Gupta et al. Nov 2004 B1
6826546 Shuster Nov 2004 B1
6827669 Cohen et al. Dec 2004 B2
6847969 Mathai et al. Jan 2005 B1
6848004 Chang et al. Jan 2005 B1
6850967 Spencer et al. Feb 2005 B1
6853982 Smith et al. Feb 2005 B2
6857024 Chen et al. Feb 2005 B1
6874018 Wu Mar 2005 B2
6877027 Spencer et al. Apr 2005 B1
6880123 Landsman Apr 2005 B1
6882981 Philippe et al. Apr 2005 B2
6892181 Megiddo et al. May 2005 B1
6892223 Kawabata et al. May 2005 B1
6892226 Tso et al. May 2005 B1
6892354 Servan-Schreiber et al. May 2005 B1
6904408 McCarthy et al. Jun 2005 B1
6910179 Pennell et al. Jun 2005 B1
6934736 Sears et al. Aug 2005 B2
6938027 Barritz Aug 2005 B1
6957390 Tamir et al. Oct 2005 B2
6958759 Safadi et al. Oct 2005 B2
6968507 Pennell et al. Nov 2005 B2
6973478 Ketonen et al. Dec 2005 B1
6976053 Tripp et al. Dec 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6990633 Miyasaka Jan 2006 B1
6993532 Platt et al. Jan 2006 B1
7003734 Gardner et al. Feb 2006 B1
7016887 Stockfisch Mar 2006 B2
7039599 Merriman et al. May 2006 B2
7043526 Wolfe May 2006 B1
7051084 Hayton et al. May 2006 B1
7054900 Goldston May 2006 B1
7065550 Raghunandan Jun 2006 B2
7069515 Eagle et al. Jun 2006 B1
7076546 Bates et al. Jul 2006 B1
7085682 Heller et al. Aug 2006 B1
7100111 McElfresh et al. Aug 2006 B2
7133924 Rosenberg et al. Nov 2006 B1
7136875 Anderson et al. Nov 2006 B2
7149791 Sears et al. Dec 2006 B2
7155729 Andrew et al. Dec 2006 B1
7162739 Cowden et al. Jan 2007 B2
7181415 Blaser et al. Feb 2007 B2
7181488 Martin et al. Feb 2007 B2
7194425 Nyhan Mar 2007 B2
7254547 Beck et al. Aug 2007 B1
7283992 Liu et al. Oct 2007 B2
7346606 Bharat Mar 2008 B2
7349827 Heller et al. Mar 2008 B1
7363291 Page Apr 2008 B1
7421432 Hoelzle et al. Sep 2008 B1
7424708 Andersson et al. Sep 2008 B2
7451065 Pednault et al. Nov 2008 B2
7454364 Shkedi Nov 2008 B2
7464155 Mousavi et al. Dec 2008 B2
7512603 Veteska et al. Mar 2009 B1
7630986 Herz Dec 2009 B1
7743340 Horvitz et al. Jun 2010 B2
7844488 Merriman et al. Nov 2010 B2
20010011226 Greer et al. Aug 2001 A1
20010029527 Goshen Oct 2001 A1
20010030970 Wiryaman et al. Oct 2001 A1
20010032115 Goldstein Oct 2001 A1
20010037240 Marks et al. Nov 2001 A1
20010037325 Biderman et al. Nov 2001 A1
20010037488 Lee Nov 2001 A1
20010044795 Cohen et al. Nov 2001 A1
20010047354 Davis et al. Nov 2001 A1
20010049320 Cohen et al. Dec 2001 A1
20010049321 Cohen et al. Dec 2001 A1
20010049620 Blasko Dec 2001 A1
20010049716 Wolfe Dec 2001 A1
20010051559 Cohen et al. Dec 2001 A1
20010053735 Cohen et al. Dec 2001 A1
20010054020 Barth et al. Dec 2001 A1
20020002483 Siegel et al. Jan 2002 A1
20020002538 Ling Jan 2002 A1
20020004754 Gardenswartz et al. Jan 2002 A1
20020007307 Miller et al. Jan 2002 A1
20020007309 Reynar Jan 2002 A1
20020007317 Callaghan et al. Jan 2002 A1
20020008703 Merrill et al. Jan 2002 A1
20020010626 Agmoni Jan 2002 A1
20020010757 Granik et al. Jan 2002 A1
20020010776 Lerner Jan 2002 A1
20020016736 Cannon et al. Feb 2002 A1
20020019763 Linden et al. Feb 2002 A1
20020019834 Vilcauskas, Jr. et al. Feb 2002 A1
20020023159 Vange et al. Feb 2002 A1
20020026390 Ulenas et al. Feb 2002 A1
20020032592 Krasnick et al. Mar 2002 A1
20020035568 Benthin Mar 2002 A1
20020038363 MacLean Mar 2002 A1
20020040374 Kent Apr 2002 A1
20020042750 Morrison Apr 2002 A1
20020046099 Frengut et al. Apr 2002 A1
20020049633 Pasquali Apr 2002 A1
20020052785 Tenenbaum May 2002 A1
20020052925 Kim et al. May 2002 A1
20020053078 Holtz et al. May 2002 A1
20020054089 Nicholas May 2002 A1
20020055912 Buck May 2002 A1
20020057285 Nicholas, III May 2002 A1
20020059094 Hosea et al. May 2002 A1
20020059099 Coletta May 2002 A1
20020065802 Uchiyama May 2002 A1
20020068500 Gabai et al. Jun 2002 A1
20020069105 do Rosario Botelho et al. Jun 2002 A1
20020073079 Terheggen Jun 2002 A1
20020077219 Cohen et al. Jun 2002 A1
20020078076 Evans Jun 2002 A1
20020078192 Kopsell et al. Jun 2002 A1
20020087499 Stockfisch Jul 2002 A1
20020087621 Hendriks Jul 2002 A1
20020091700 Steele et al. Jul 2002 A1
20020091875 Fujiwara et al. Jul 2002 A1
20020094868 Tuck et al. Jul 2002 A1
20020099605 Weitzman et al. Jul 2002 A1
20020099767 Cohen et al. Jul 2002 A1
20020099812 Davis et al. Jul 2002 A1
20020099824 Bender et al. Jul 2002 A1
20020103811 Fankhauser et al. Aug 2002 A1
20020107847 Johnson Aug 2002 A1
20020107858 Lundahl et al. Aug 2002 A1
20020111910 Walsh Aug 2002 A1
20020111994 Raghunandan Aug 2002 A1
20020112035 Carey et al. Aug 2002 A1
20020112048 Gruyer et al. Aug 2002 A1
20020116494 Kocol Aug 2002 A1
20020120648 Ball et al. Aug 2002 A1
20020122065 Segal et al. Sep 2002 A1
20020123912 Subramanian et al. Sep 2002 A1
20020128904 Carruthers et al. Sep 2002 A1
20020128908 Levin et al. Sep 2002 A1
20020128925 Angeles Sep 2002 A1
20020152121 Hiroshi Oct 2002 A1
20020152126 Lieu et al. Oct 2002 A1
20020152222 Holbrook Oct 2002 A1
20020154163 Melchner Oct 2002 A1
20020156781 Cordray et al. Oct 2002 A1
20020156812 Krasnoiarov et al. Oct 2002 A1
20020169670 Barsade et al. Nov 2002 A1
20020169762 Cardona Nov 2002 A1
20020170068 Rafey et al. Nov 2002 A1
20020171682 Frank et al. Nov 2002 A1
20020175947 Conrad et al. Nov 2002 A1
20020194151 Fenton et al. Dec 2002 A1
20020198778 Landsman et al. Dec 2002 A1
20030004804 Landsman et al. Jan 2003 A1
20030005000 Landsman et al. Jan 2003 A1
20030005067 Martin et al. Jan 2003 A1
20030005134 Martin et al. Jan 2003 A1
20030011639 Webb Jan 2003 A1
20030014304 Calvert et al. Jan 2003 A1
20030014399 Hansen et al. Jan 2003 A1
20030018778 Martin et al. Jan 2003 A1
20030018885 Landsman et al. Jan 2003 A1
20030023481 Calvert et al. Jan 2003 A1
20030023488 Landsman et al. Jan 2003 A1
20030023698 Dieberger et al. Jan 2003 A1
20030028529 Cheung et al. Feb 2003 A1
20030028565 Landsman et al. Feb 2003 A1
20030028870 Weisman et al. Feb 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030033155 Peerson et al. Feb 2003 A1
20030040958 Fernandes Feb 2003 A1
20030041050 Smith et al. Feb 2003 A1
20030046150 Ader et al. Mar 2003 A1
20030050863 Radwin Mar 2003 A1
20030052913 Barile Mar 2003 A1
20030074448 Kinebuchi Apr 2003 A1
20030088554 Ryan et al. May 2003 A1
20030105589 Liu et al. Jun 2003 A1
20030110080 Tsutani et al. Jun 2003 A1
20030115157 Circenis Jun 2003 A1
20030120593 Bansal et al. Jun 2003 A1
20030120654 Edlund et al. Jun 2003 A1
20030131100 Godon et al. Jul 2003 A1
20030135490 Barrett et al. Jul 2003 A1
20030135853 Goldman et al. Jul 2003 A1
20030154168 Lautenbacher Aug 2003 A1
20030171990 Rao et al. Sep 2003 A1
20030172075 Reisman Sep 2003 A1
20030176931 Pednault et al. Sep 2003 A1
20030182184 Strasnick et al. Sep 2003 A1
20030195837 Kostic et al. Oct 2003 A1
20030195877 Ford et al. Oct 2003 A1
20030208472 Pham Nov 2003 A1
20030220091 Farrand et al. Nov 2003 A1
20030221167 Goldstein et al. Nov 2003 A1
20030229542 Morrisroe Dec 2003 A1
20040002896 Alanen et al. Jan 2004 A1
20040024756 Rickard Feb 2004 A1
20040030798 Anderson et al. Feb 2004 A1
20040044677 Huper-Graff et al. Mar 2004 A1
20040068486 Chidlovskii Apr 2004 A1
20040073485 Liu et al. Apr 2004 A1
20040078294 Rollins et al. Apr 2004 A1
20040095376 Graham et al. May 2004 A1
20040098229 Error et al. May 2004 A1
20040098449 Bar-Lavi et al. May 2004 A1
20040117353 Ishag et al. Jun 2004 A1
20040133845 Forstall et al. Jul 2004 A1
20040162738 Sanders et al. Aug 2004 A1
20040162759 Willis Aug 2004 A1
20040163101 Swix et al. Aug 2004 A1
20040167926 Anderson et al. Aug 2004 A1
20040167928 Anderson et al. Aug 2004 A1
20040181525 Itzhak et al. Sep 2004 A1
20040181604 Immonen Sep 2004 A1
20040193488 Khoo et al. Sep 2004 A1
20040210533 Picker et al. Oct 2004 A1
20040225716 Shamir et al. Nov 2004 A1
20040247748 Bronkema Dec 2004 A1
20040249709 Donovan et al. Dec 2004 A1
20040249938 Bunch Dec 2004 A1
20040254810 Yamaga et al. Dec 2004 A1
20040267723 Bharat Dec 2004 A1
20050015366 Carrasco et al. Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050027821 Alexander et al. Feb 2005 A1
20050027822 Plaza Feb 2005 A1
20050033657 Herrington et al. Feb 2005 A1
20050038819 Hicken et al. Feb 2005 A1
20050080772 Bem Apr 2005 A1
20050086109 McFadden et al. Apr 2005 A1
20050091106 Reller et al. Apr 2005 A1
20050091111 Green et al. Apr 2005 A1
20050097088 Bennett et al. May 2005 A1
20050102202 Linden et al. May 2005 A1
20050102282 Linden May 2005 A1
20050125382 Karnawat et al. Jun 2005 A1
20050131762 Bharat et al. Jun 2005 A1
20050132267 Aviv Jun 2005 A1
20050149404 Barnett et al. Jul 2005 A1
20050155031 Wang et al. Jul 2005 A1
20050182773 Feinsmith Aug 2005 A1
20050187823 Howes Aug 2005 A1
20050203796 Anand et al. Sep 2005 A1
20050204148 Mayo et al. Sep 2005 A1
20050216572 Tso et al. Sep 2005 A1
20050222901 Agarwal et al. Oct 2005 A1
20050222982 Paczkowski et al. Oct 2005 A1
20050240599 Sears Oct 2005 A1
20050273463 Zohar et al. Dec 2005 A1
20050289120 Soulanille et al. Dec 2005 A9
20060015390 Rijsinghani et al. Jan 2006 A1
20060026233 Tenembaum et al. Feb 2006 A1
20060031253 Newbold et al. Feb 2006 A1
20060053230 Montero Mar 2006 A1
20060136524 Wohlers et al. Jun 2006 A1
20060136528 Martin et al. Jun 2006 A1
20060136728 Gentry et al. Jun 2006 A1
20060235965 Bennett et al. Oct 2006 A1
20060253432 Eagle et al. Nov 2006 A1
20070016469 Bae et al. Jan 2007 A1
20070038956 Morris Feb 2007 A1
Foreign Referenced Citations (38)
Number Date Country
0631231 Dec 1994 EP
0822535 Feb 1998 EP
1045547 Oct 2000 EP
1154611 Nov 2001 EP
1 207 468 May 2002 EP
343825 Feb 1991 JP
11066099 Sep 1999 JP
2002024221 Jan 2001 JP
2001084256 Mar 2001 JP
2001147894 May 2001 JP
20010222535 Aug 2001 JP
2001312482 Nov 2001 JP
2002032401 Jan 2002 JP
2002073545 Mar 2002 JP
2002259371 Sep 2002 JP
2002334104 Nov 2002 JP
2003058572 Feb 2003 JP
2003141155 May 2003 JP
2003178092 Jun 2003 JP
20030271647 Sep 2003 JP
2004-355376 Dec 2004 JP
WO 9847090 Oct 1998 WO
WO 9938321 Jul 1999 WO
WO 9944159 Sep 1999 WO
WO 9946701 Sep 1999 WO
WO 9955066 Oct 1999 WO
WO 9959097 Nov 1999 WO
WO 0004434 Jan 2000 WO
WO 0054201 Sep 2000 WO
WO 0103028 Jan 2001 WO
WO 0115052 Mar 2001 WO
WO 0139024 May 2001 WO
WO 0144992 Jun 2001 WO
WO 0163472 Aug 2001 WO
WO 0169929 Sep 2001 WO
WO 0190917 Nov 2001 WO
WO 0244869 Jun 2002 WO
WO 03010685 Feb 2003 WO
Related Publications (1)
Number Date Country
20060294226 A1 Dec 2006 US
Provisional Applications (1)
Number Date Country
60694533 Jun 2005 US