Updating content of presentation vehicle in a computer network

Information

  • Patent Grant
  • 8316003
  • Patent Number
    8,316,003
  • Date Filed
    Monday, October 12, 2009
    15 years ago
  • Date Issued
    Tuesday, November 20, 2012
    12 years ago
Abstract
Exemplary systems and methods for updating content on a computer network are provided. In exemplary embodiments, a method includes receiving from a message delivery program on a client computer a first keyword submitted by a web browser on the client computer to an original search engine, the original search engine not being a part of the server computer, the web browser being separate from the message delivery program and providing the client computer a first search result that is different from a search result provided by the original search engine.
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 presentation of information in a computer network.


2. Description of the Background Art


The Internet is an example of a computer network. On the Internet, end-users on client computers may access various types of information resident in server computers. A server computer that provides information over the Internet is also referred to as a “web server” or a “web site”. A web site may provide information about various topics or offer goods and services. Some web sites include a search engine that allows an end-user to search on the Internet. Examples of such web sites include Yahoo, Google, and Alta Vista. A web site may also include a search engine for searching the web site. For example, an on-line bookstore may include a search engine for allowing a prospective buyer to look for specific novels available from the bookstore.


Just like in other media such as radio and television, companies may advertise on the Internet. Advertising revenues may help pay for the development and maintenance of free software (i.e., a computer program) or a web site. Advertisements on the Internet may be displayed using various presentation vehicles, such as pop-ups, pop-unders, and banners. Pop-ups are typically displayed over a web page to immediately attract an end-user's attention. Pop-unders, on the other hand, are displayed under a web page, and are not visible until the end-user closes the web page. Banners are typically displayed as part of a web page.


Generally speaking, the efficacy of an advertising campaign on the Internet may be measured in terms of “click-through” rate, which takes into account the number of times an advertisement has been clicked on (e.g., using a mouse) by end-users. The higher the click-through rate, the more effective the advertising. Because effective advertising results in higher revenue not only for manufacturers of products being advertised but also for companies who display the advertisements, increasing click-through rates is generally desirable.


To increase the chance of an end-user clicking on an advertisement, advertisers have developed “targeting techniques” to match advertisements with particular end-users. For example, some web sites employ cookies to keep track of end-user purchasing activity on the web site. This allows a web site to advertise, to an end-user, products that are related to those previously purchased by the end-user. A specific example of this targeting technique is to advertise a romance novel to an end-user who has previously purchased books in the same category. Some advertisers also develop end-user profiles that are based on demographic information. An advertiser may use an end-user profile to identify advertisements that may be of interest to a particular end-user.


SUMMARY

The present invention relates to presentation of information in a computer network. The present invention may be employed in various applications including advertising in a computer network such as the Internet, for example.


In one embodiment, a first search result responsive to a first search request is displayed in a presentation vehicle that is separate from a browser employed by an end-user to submit the first search request. The presentation vehicle may be a pop-under, for example. Upon detection of a second search request submitted by the end-user, the same presentation vehicle may be updated to display a second search result. This advantageously minimizes proliferation of presentation vehicles on the end-user's computer screen.


In another embodiment, a presentation vehicle is employed to display a first content responsive to a first end-user behavior. An end-user behavior may be an activity that an end-user engages in while on a computer network. The end-user behavior may be navigation from one web site to another web site or submission of a search request, for example. The presentation vehicle may be updated to display a second content in response to a second end-user behavior.


In exemplary embodiments, a method includes receiving from a message delivery program on a client computer a first keyword submitted by a web browser on the client computer to an original search engine, the original search engine not being a part of the server computer, the web browser being separate from the message delivery program and providing the client computer a first search result that is different from a search result provided by the original search engine. The method may further comprise receiving from the client computer a second keyword submitted to the original search engine, and providing the client computer a second search result that is different from another search result provided by the original search engine. The first search result may be displayed in a presentation vehicle that is updated to display the second search result. Further, the presentation vehicle comprises a pop-under.


An exemplary apparatus for receiving information over a computer network comprises a client computer configured to submit, by a browser, a first search request and to receive a first search result and a second search result responsive to the first search request, the first search result to be displayed in a first window and a second search result to be displayed in a second window, the first window being displayed in the browser, the second window being displayed in a presentation vehicle separate from the browser.


The second window may be displayed under the first window. The client computer may be further configured to receive a third search result that is responsive to another search request, the third search result is to be displayed in the second window. The first window may comprise a web browser pointed to a search engine and the second window comprises a pop-under.


An exemplary apparatus for receiving information over the Internet comprises a client computer configured to display a search result in a pop-under.


A exemplary method of presenting information to an end-user in a computer network comprises detecting a first end-user behavior in a browser, displaying a first content in a presentation vehicle separate from the browser, the first content being responsive to the first end-user behavior, detecting a second end-user behavior, and updating the presentation vehicle with a second content responsive to the second end-user behavior.


The first end-user behavior may comprise submitting a first search request and the second end-user behavior comprises submitting a second search request. The first content may comprise a first search result and the second content comprises a second search result. The first end-user behavior may comprise navigating to a first web page and the second end-user behavior comprises navigating to a second web page.


In various embodiments, a computer readable medium comprises executable instructions. The instructions executable may by a processor to perform a method. The method may comprise receiving from a message delivery program on a client computer a first keyword submitted by a web browser on the client computer to an original search engine, the original search engine not being a part of the server computer, the web browser being separate from the message delivery program and providing the client computer a first search result that is different from a search result provided by the original search engine.


The method may further comprise receiving from the client computer a second keyword submitted to the original search engine and providing the client computer a second search result that is different from another search result provided by the original search engine.


The first search result may be displayed in a presentation vehicle that is updated to display the second search result. The presentation vehicle may comprise a pop-under.


In some embodiments, a computer readable medium comprises executable instructions. The instructions executable may by a processor to perform a method. The method may comprise detecting a first end-user behavior in a browser, displaying a first content in a presentation vehicle separate from the browser, the first content being responsive to the first end-user behavior, detecting a second end-user behavior, and updating the presentation vehicle with a second content responsive to the second end-user behavior.


The first end-user behavior may comprise submitting a first search request and the second end-user behavior comprises submitting a second search request. The first content may comprise a first search result and the second content may comprise a second search result. The first end-user behavior may comprise navigating to a first web page and the second end-user behavior comprises navigating to a second web page.


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 schematically illustrates an embodiment of the present invention.



FIG. 2 shows a schematic diagram of a computer network in accordance with an embodiment of the present invention.



FIG. 3 shows a schematic diagram of a client computer in accordance with an embodiment of the present invention.



FIG. 4A shows a web browser pointed to an Internet search engine.



FIG. 4B shows the web browser of FIG. 4A after a search.



FIG. 5 shows a schematic diagram of a message server computer in accordance with an embodiment of the present invention.



FIG. 6, which consists of FIGS. 6A and 6B, shows a flow diagram of a method of responding to an end-user request for information in accordance with an embodiment of the present invention.



FIGS. 7 and 8 show search results in accordance with embodiments of the present invention.



FIGS. 9(
a)-9(d) schematically illustrate a pop-under in accordance with an embodiment of the present invention.



FIG. 10 shows a flow diagram of a method of displaying information received over a computer network in accordance with an embodiment of the present invention.



FIG. 11 shows a flow diagram of another method of displaying information received over a computer network 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 systems, 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.


It is to be noted that although embodiments of the present invention are described herein in the context of the Internet, the present invention is not so limited and may be used in other data processing applications.


An embodiment of the present invention is schematically illustrated in FIG. 1. In FIG. 1, an end-user on a client computer submits a search request to a search engine (hereinafter referred to as “original search engine”) on the Internet (see arrow 21). The original search engine may perform an “Internet search”, or a search limited to a particular web site or domain name. The search request may be a query comprising one or more keywords, for example. The original search engine responds to the search request by sending a search result to the client computer (see arrow 22). The search result may include a list of documents (e.g., web pages), links to documents, or other information relating to the keywords. A specific example of the just described scenario is an end-user typing the keyword “car” in a search engine and receiving back links to web sites that talk about car clubs, exotic cars, car racing, and like information.


A search request is an express manifestation of end-user interest in something. That is, an end-user requesting information about a topic has expressed an interest in that topic. To take advantage of this, a message delivery program resident in the client computer listens for requests for information such as a search request. When the message delivery program detects that an end-user is performing a search (see arrow 23), the message delivery program responds to the search request by displaying its own search result in the client computer (see arrow 24). The search result of the message delivery program may be displayed in a window that is under a window containing the search result from the original search engine, for example. The search result of the message delivery program may include information cached in the client computer, served by a server computer (e.g., an adserver), or provided by another search engine, for example. The search result displayed by the message delivery program may contain advertisements relating to the keyword included in the end-user's search request. Because the advertisements relate to the end-user's search request, the probability that the end-user will be interested in one or more of the advertisements is thus improved. In the car example, the message delivery program may compile a list of car-related advertisements and display them to the end-user.


Preferably, the message delivery program is resident in the client computer so that it can respond to an end-user's search request even when the end-user uses different search engines. That is, unlike other targeting techniques that only work when an end-user is on a particular web site, embodiments of the present invention may work across different web sites. An end-user may obtain the message delivery program by itself or along with free or reduced-cost computer programs, services, and other products.


Referring now to FIG. 2, there is shown a schematic diagram of a computer network 100 in accordance with an embodiment of the present invention. Network 100 may include one or more client computers 101, one or more web server computers 102, one or more message server computers 103, and other computers not shown. Intermediate nodes such as gateways, routers, bridges, Internet service provider networks, public-switched telephone networks, proxy servers, firewalls, and other network components are not shown for clarity. In the example of FIG. 2, network 100 includes the Internet; however, other types of computer networks may also be used. Computers may be coupled to network 100 using any type of connection without detracting from the merits of the present invention.


A client computer 101 is typically, but not necessarily, a personal computer such as those running the Microsoft Windows™, Apple Macintosh™, Linux, or UNIX operating systems. An end-user may employ a suitably equipped client computer 101 to get on network 100 and access computers coupled thereto. For example, a client computer 101 may be used to access web pages from a web server computer 102. It is to be noted that as used in the present disclosure, the term “computer” includes any type of data processing device including personal digital assistants, digital telephones, wireless terminals, and the like.


A web server computer 102 may be a web site containing information designed to attract end-users surfing on the Internet. A web server computer 102 may also include advertisements, downloadable computer programs, a search engine and products available for online purchase. A web server computer 102 may also be an ad server for delivering advertisements to a client computer 101.


A message server computer 103 may include the functionalities of a web server computer 102. Additionally, in one embodiment, a message server computer 103 may also include message units for delivery to a client computer 101. The message units may contain advertisements, for example. Message units are further described below. A message server computer 103 may also include downloadable computer programs and files for supporting, updating, or maintaining components in a client computer 101.


Web server computers 102 and message server computers 103 are typically, but not necessarily, server computers such as those available from Sun Microsystems, Hewlett-Packard, or International Business Machines. A client computer 101 may communicate with a web server computer 102 or a message server computer 103 using client-server protocol. It is to be noted that client-server computing is well known in the art and will not be further described here.



FIG. 3 schematically illustrates the components of a client computer 101 in accordance with an embodiment of the present invention. In one embodiment, the components of client computer 101 shown in FIG. 3 are implemented in software. It should be understood, however, that components in the present disclosure 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 medium may comprise computer-readable 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 run by a microprocessor. Components may be implemented separately in multiple modules or together in a single module.


As shown in FIG. 3, client computer 101 may include a web browser 201 and a message delivery program 200. Web browser 201 may be a commercially available web browser or web client running on a client computer 101. In one embodiment, web browser 201 is the Microsoft Internet Explorer™. web browser.


In one embodiment, message delivery program 200 is downloadable from a message server computer 103. Message delivery program 200 may be downloaded in conjunction with the downloading of another computer program. For example, message delivery program 200 may be downloaded to a client computer 101 along with a utility program that is provided free of charge or at a reduced cost. The utility program may be provided to an end-user in exchange for the right to deliver messages to the end-user via message delivery program 200. In essence, revenue (e.g., advertising fees) from messages delivered to the end-user helps defray the cost of creating and maintaining the utility program.


Message delivery program 200 may include a message retriever 202, a message processor 203, a message cache 204, a context watcher 205, a hash table 206, and a search module 250. Other components such as operating system components, utility programs, application programs, and the like are not shown for clarity of illustration.


Message retriever 202 may include computer-readable program code for requesting message units from message server computer 103. As will be explained later on in connection with FIG. 5, a message unit may include a message content. A message content may include, without limitation, information to be displayed on a computer screen, audio to be played, or computer-readable program code (e.g., Java applet, script, HTML, hyperlink, pointer to a web page containing a search result). In one embodiment, a message unit may be a rules message unit or a search message unit. A search message unit may be distinguished from a rules message unit by a field in the message unit referred to as a “search field” (see search field 352 in FIG. 5). A rules message unit is processed when a set of rules has been satisfied, whereas a search message unit is processed when the end-user performs a search using certain keywords. Message units are processed according to their message contents. For example, a message unit containing displayable message content is processed by displaying its message content on a computer screen, a message unit whose message content includes computer-readable program code is processed by running its message content, and so on.


Still referring to FIG. 3, message retriever 202 monitors web browser 201 for the uniform resource locator (URL) of web sites visited by an end-user surfing on the Internet. For each domain visited by an end-user, message retriever 202 may send a request packet to message server computer 103. In one embodiment, a request packet includes:

    • (a) the end-user's unique identification (ID) number;
    • (b) the ID number of client computer 101;
    • (c) the local time;
    • (d) the domain name of the web site visited by the end-user; and
    • (e) a list of message units stored in message cache 204.


In one embodiment, personal information such as the actual name of the end-user, credit card information, residence address, and the like is stored solely in client computer 101 to protect the end-user's privacy.


Message server computer 103 checks if there is a corresponding message unit for each request packet received from client computer 101. If so, message server computer 103 sends the corresponding message unit to client computer 101. For example, message retriever 202 may send a request packet to message server computer 103 as an end-user navigates from “storekeeper.com” to “cars.com.” If a message unit is available for the domain “cars.com”, message server computer 103 will send that message unit to client computer 101.


Client computer 101 may also include a hash table 206. Hash table 206 may contain information for determining whether a message unit is available for a particular domain. This allows message retriever 202 to first query hash table 206 before sending a request packet to message server computer 103. If hash table 206 indicates that there is a message unit for a domain visited by the end-user, message retriever 202 may proceed to send a request packet to message server computer 103. Otherwise, message retriever 202 may not send a request packet, thereby minimizing the amount of request packets sent to and processed by message server computer 103.


Message processor 203 may include computer-readable program code for processing a message unit. Message processor 203 may process a message unit by displaying its message content. Message processor 203 may display a message content using a variety of presentation vehicles including pop-ups, pop-unders, banners, message boxes, text boxes, sliders, separate windows, windows embedded in a web page, and other mechanisms for displaying information. Message processor 203 may also process a message unit by playing its message content if the message content is audio or video, or by running its message content if the message content is computer-readable program code, for example. As an example, message processor 203 may process a message unit by displaying a pop-under (or other presentation vehicle) pointed to a web page containing a search result.


Context watcher 205 may include computer-readable program code for determining if a message unit has been triggered for processing. Context watcher 205 checks message cache 204 for rules message units whose rules have been satisfied and search message units that relate to an end-user's search request. If context watcher 205 finds such a rules message unit or a search message unit, context watcher 205 alerts message processor 203 to process the message unit.


Message delivery program 200 further includes a search module 250. In one embodiment, search module 250 includes the following components: a keyword extractor 252, a keyword file 254, and a keyword processor 255.


Keyword extractor 252 may include computer-readable program code for parsing a search request. In one embodiment, keyword extractor 252 parses a search request to extract one or more keywords from a URL displayed in the address window of a web browser in response to a search request by an end-user. Popular search engines respond to a search request by pointing the web browser employed by the end-user to a web page containing the search result. The URL of that web page may be parsed to extract the keywords chosen by the end-user for his search. For example, performing a search for “hotrod” and “car” in a fictitious search engine referred to herein as “finderskeepers.com” will result in a web browser being pointed to a web page with the following URL:

    • http://search.finderskeepers.com/bin/search?p=hotrod+car


The web page with the URL “http://search.finderskeepers.com/bin/search?p=hotrod+car” contains the search result for the keywords “hotrod” and “car”. Knowing the URL format employed by finderskeepers.com allows extraction of the words following “. . . search?p=” and separated by “+”. String manipulation functions may be used to extract keywords from the URL. It is to be noted that different search engines may employ different URL formats. Accordingly, keyword extractor 252 may first parse the URL to determine the name of the search engine, and then employ parsing rules for that search engine. In the present example, keyword extractor 252 may first parse the URL “http://search.finderskeepers.com/bin/search?p=hotrod- +car” to get the name of the search engine, which is “. . . finderskeepers.com/ . . . ”, and then apply parsing rules for finderskeepers.com. Keyword extractor 252 may take advantage of delimiters and end of string indicators employed by a particular search engine to parse a URL. In one embodiment, keyword extractor 252 includes parsing rules for popular search engines.



FIG. 4A shows a web browser 201 pointed to the URL indicated in address window 430. In the example of FIG. 4A, web browser 201 is pointed to finderskeepers.com where an end-user is searching for information about hotrods and cars. FIG. 4B shows web browser 201 and address window 430 after the search using the keywords “hotrod” and “car”.


Referring back to FIG. 3, search module 250 also includes a keyword file 254. In one embodiment, keyword file 254 is a text file containing a list of relevant keywords referred to as “an include list” and a list of non-relevant keywords referred to as an “exclude list”. Note that keyword file 254 may have also have an include list but not an exclude list or vice versa. Keyword file 254 may be downloadable from message server computer 103 to ensure that client computer 101 always has the most current keyword file. Keywords in the include list have corresponding message units, whereas keywords in the exclude list have no corresponding message units. As will be explained later below, keywords in the include list are processed by keyword processor 255, whereas keywords in the exclude list are not processed. In one embodiment, keyword processor 255 processes a keyword by sending the keyword to message server computer 103 to obtain further information about the keyword. By first examining the exclude list before sending keywords to message server computer 103, keywords that have no corresponding message units are identified at client computer 101, thereby minimizing traffic to message server computer 103. Likewise, traffic to message server computer 103 may be minimized by first determining if a keyword is in the include list before sending the keyword to message server computer 103. Table 1 shows the contents of an example keyword file 254.











TABLE 1






Include List
Exclude List








hotrod
paper



car
the



books
for



computer
Britney



cellular
. . .



sports
. . .



wine
. . .



. . .
. . .









In the example of Table 1, the exclude list includes non-relevant words such as commonly used words that are too general to be useful. The exclude list may also include words that have no commercial value. For example, “Britney” may have no commercial value to most advertisers except those affiliated with or licensed by Britney the pop-star.


In the example of Table 1, the include list includes relevant words. In one embodiment, a word is considered relevant if there is a corresponding message unit for that word. For example, the word “computer” may be relevant if there is a message unit containing an advertisement for a personal computer. Similarly, the word “book” may be relevant if there is a message unit relating to books.


Still referring to FIG. 3, search module 250 includes keyword processor 255. Keyword processor 255 may include computer-readable program code for processing a keyword. In one embodiment, a keyword may be processed by determining if a keyword is relevant and working with message server computer 103 to identify message units 301 that relate to the keyword. Keyword processor 255 is further described in connection with FIG. 6.



FIG. 5 schematically illustrates the components of a message server computer 103 in accordance with an embodiment of the present invention. As mentioned, message server computer 103 receives request packets from a client computer 101. Each received request packet may include the domain name of the web site visited by an end-user. Message server computer 103 uses the domain name to find all message units available for that web site. For example, a message unit may contain an advertisement for a car company that wants to display its advertisement to end-users visiting car-related web sites, such as the “cars.com” web site. When a request packet indicates that an end-user is on “cars.com”, the message unit containing the car company's advertisement will be sent to the requesting client computer 101.


A message server computer 103 may include one or more message units 301 and a database 310. Database 310 may be a commercially available database program. Database 310 is used to keep track of message units 301 and keyword related information in message server computer 103. For example, message server computer 103 may query database 310 for all message units 301 available for a particular web site.


A message unit 301 may include a message content 302, a vehicle 303, rules 304, an expiration date 305, an advertiser ID 351, a search field 352, and a local field 353. Message content 302 may include computer-readable program code, text, images, audio, video, hyperlink, and other information. A message content 302 may be an advertisement or a search result (or pointers thereto) to be displayed on a computer screen, for example.


Vehicle 303 indicates the presentation vehicle to be used in presenting message content 302 to an end-user. For example, vehicle 303 may call for the use of a pop-up, pop-under, banner, message box, text box, slider, separate window, window embedded in a web page, and the like.


A message unit 301 may include a search field 352. A search field 352 may be a Boolean variable for indicating whether a message unit 301 is a rules message unit or a search message unit. In one embodiment, a message unit 301 is a rules message unit when search field 352 is set to logical FALSE; otherwise, the message unit 301 is a search message unit.


As will be explained further below, a message unit 301 may include a local field 353 for indicating whether a keyword is to be evaluated against a local include list only.


A message unit 301 may include rules 304 for specifying the conditions that need to be satisfied before the message unit is triggered for processing. Rules 304 may specify to display a message content 302 when an end-user navigates to a specific web page or as soon as the message unit 301 is received in a client computer 101. For example, a car company may contract with the operator of a message server computer 103 to deliver a message unit 301 containing an advertisement for a minivan (hereinafter, “minivan message unit”). The rules 304 of the minivan message unit may specify that the minivan advertisement is to be displayed to end-users viewing the minivan web page of “cars.com”. In this example, the minivan web page of cars.com has the URL “www.cars.com/minivans”. When an end-user visits the main page (or any web page) of “cars.com”, message retriever 202 (see FIG. 3) will send a request packet to message server computer 103 indicating that the end-user is on “cars.com”. In response, message server computer 103 will send the minivan message unit to client computer 101. When the end-user navigates to the URL “www.cars.com/minivans”, context watcher 205 will detect that the minivan message unit has been triggered for display (i.e., rules 304 of the minivan message unit have been satisfied). Context watcher 205 will accordingly inform message processor 203, which will then process the minivan message unit by displaying its message content.


Rules 304 may also include: (a) a list of domain names at which the content of a message unit 301 is to be displayed, (b) URL sub-strings that will trigger displaying of the content of the message unit 301, and (b) time and date information. As can be appreciated, rules 304 may also be extended to take into account additional information relating to an end-user (as identified by a corresponding end-user ID) such as the end-user's frequent flyer affiliation, club memberships, type of credit card used, hobbies and interests, and basic demographic information. End-user related information may be stored in client computer 101 or database 310 of message server computer 103. End-user related information may be used for targeted advertising purposes, for example.


As shown in FIG. 5, a message unit 301 may also include an expiration date 305. Expiration date 305 indicates the latest date and time the message unit 301 can still be displayed. Expired message units 301 do not have to be processed and may be removed from client computer 101.


A message unit 301 may include an advertiser ID 351 for identifying a particular search message unit. Note that an advertiser ID 351 does not necessarily have to be associated with an advertiser. Additionally, an advertiser ID 351 does not necessarily have to identify a message unit 301 that contains advertising. That is, an advertiser ID 351 may be used to keep track of message units 301 in general.


Other techniques for receiving and processing message units are also described in the following commonly-assigned disclosure, which is incorporated herein by reference in its entirety: U.S. application Ser. No. 10/152,204, filed on May 21, 2002, by Scott G. Eagle, David L. Goulden, Anthony G. Martin, and Eugene A. Veteska, issued Jun. 27, 2006 as U.S. Pat. No. 7,069,515.



FIG. 6, which consists of FIGS. 6A and 6B, shows a flow diagram of a method 600 of responding to end-user request for information in accordance with an embodiment of the present invention. The steps of method 600 are described herein using the aforementioned components of client computer 101 and message server computer 103 as an example. However, it should be understood that method 600 is not so limited and may also be implemented using other components.


Beginning in step 602, one or more message units 301 are received in client computer 101 from message server computer 103. In one embodiment, a message unit 301 is received in client computer 101 in response to an end-user navigating to a particular web site. That particular web site may include a search engine, for example. Navigation to a web site that has a search engine indicates that the end-user is intending to perform a search, and thus causes delivery of search message units intended for that web site. Message retriever 202 monitors web browser 201 for the URL of web sites visited by the end-user, and accordingly asks message server computer 103 for message units available for each web site, if any. Message units 301 received from message server computer 103 may be stored in message cache 204. As mentioned, a message unit 301 may be a rules message unit or a search message unit depending on the state of its search field 352 (see FIG. 5).


In step 604, message retriever 202 detects an end-user request for information and so informs keyword processor 255. An example end-user request for information is a search request submitted to an Internet search engine. In one embodiment, a search request is detected by monitoring an address window of a web browser (e.g., see address window 430 shown in FIG. 4A) for a URL with the string “search” in it (e.g., “. . . search.domain_name/ . . .”) or a domain name of a known search engine. It is to be noted that the mechanics of monitoring an end-user's browsing activity, such as determining where an end-user is navigating to, what an end-user is typing on a web page, when an end-user activates a mouse or keyboard, and the like, is, in general, known in the art and is not further described here.


In step 606, keyword extractor 252 extracts one or more keywords from the end-user request for information. The keywords may be words employed in a search request submitted to a search engine. In one embodiment, keywords are extracted by parsing a URL appearing in an address window of a web browser after the submission of a search request.


In step 608, keyword processor 255 requests message server computer 103 to send a keyword file 254 to client computer 101. A keyword file 254 may be periodically downloaded from message server computer 103 to ensure that the keywords contained therein are current. Depending on the application, a keyword file 254 may also be downloaded once upon installation of message delivery program 200 in client computer 101, or from time to time but not necessarily every time an end-user navigates to a new web site.


In step 610, client computer 101 receives a keyword file 254 from message server computer 103. An include list in a keyword file 254 in client computer 101 is also referred to as a “local include list”.


In step 612, keyword processor 255 determines if a keyword extracted from a search request is in an exclude list of keyword file 254. If the keyword is in the exclude list, the keyword is not deemed relevant and accordingly ignored by keyword processor 255. Processing of the keyword continues to step 616 if the keyword is not in the exclude list.


In step 616, keyword processor 255 determines if it is supposed to limit its determination of whether the keyword is relevant or not to an include list locally available in a keyword file 254 in client computer 101 (instead of in message server computer 103). Whether or not keyword processor 255 should only consult a local include list may be determined by examining local field 353 of a search message unit 301. Limiting keyword processor 255 to a local include list advantageously minimizes traffic to message server computer 103.


In steps 616, 618, and 620, the keyword is not processed if keyword processor 255 is limited to a local include list and the keyword is not in that local include list. For example, if local field 353 of a search message unit 301 indicates that only a local include list is to be consulted and the keyword is not in the local include list, that particular search message unit 301 will not be triggered for processing.


In step 622, keyword processor 255 sends the keyword to message server computer 103 if keyword processor 255 is not limited to a local include list (step 616 to step 622). Keyword processor 255 also sends the keyword to message server computer 103 if keyword processor 255 is limited to a local include list and the keyword is in that local include list. Message server computer 103 receives the keyword and then employs database 310 (see FIG. 5) to identify search message units 301 in client computer 101 that relate to the keyword and accordingly may need to be processed


In step 624, client computer 101 receives a keyword ID and a list of advertiser IDs from message server computer 103, if any. The list of advertiser IDs identify search message units 301 that relate to the keyword. For example, if the keyword is “car” and there is a search message unit 301 containing an advertisement for a car company who is interested in search requests with the word “car” in it, the advertiser ID for that search message unit 301 is sent by message server computer 103 to client computer 101. The keyword ID is an arbitrarily assigned identification for the keyword. The keyword ID may be used for statistical and logging purposes (e.g., how many times the word “car” appeared in a search request). Search message units 301 in client computer 101 whose advertiser IDs match those in the list of advertiser IDs received from message computer 103 are deemed triggered for processing.


In step 626, context watcher 205 identifies the triggered search message units 301 and accordingly alerts message processor 203 to process them.


A triggered search message unit 301 with a displayable message content may be processed by displaying its content. A triggered search message unit 301 with an executable message content may be processed by running its content. For example, a search message unit 301 may include a hyperlink to the URL of one or more web pages designated to contain a search result for a particular keyword. As a further example, a message server computer 103, another search engine (i.e., not the “original” search engine the end-user is actively using), or both may perform a search for the keyword and post the search results on a designated web page pointed to by a search message unit 301 that has been triggered for processing. A message server computer 103 may request the other search engine to perform the search after the message server computer 103 receives the keyword from client computer 101 and deems the keyword relevant.



FIG. 7 shows a search result 710 in accordance with an embodiment of the present invention. Search result 710 includes a window 711 containing items 712 (i.e., 712A, 712B, 712C, . . . ). Each item 712 may be the message content of a triggered search message unit 301. For example, item 712A may be from the message content of a triggered search message unit that relates to the keywords “money” and “cash”. As another example, the contents of window 711 may also be from a web page pointed to by a hyperlink in a message content of a triggered search message unit 301; the web page pointed to by the hyperlink may contain the results of a search performed by another search engine.



FIG. 8 shows a search result 810 in accordance with an embodiment of the present invention. Search result 810 includes a browser window 811 containing items 812 (i.e., 812A, 812B, 812C, . . . ). Each item 812 may be the message content of a triggered search message unit 301. For example, item 812A may be from the message content of a triggered search message unit 301 that relates to the keyword “computer.” As discussed above, items 812 may also be from a search result of another search engine. Browser window 811 further includes a text box 813 containing the keyword “computer”, which in this example was the keyword typed by an end-user in the original search engine (not shown) (i.e., the search engine the end-user is actively using). Keyword processor 255 may receive the keyword “computer” from keyword extractor 252, and then paste the keyword in text box 813. Search result 710 of FIG. 7 or search result 810 of FIG. 8 may be displayed on a computer screen under a browser window displaying search results from the original search engine, for example.


In another aspect of the present invention, a search result is displayed in an updateable presentation vehicle. The updateable presentation vehicle may be created once, and then refreshed with new search results as an end-user refines his search. This advantageously minimizes proliferation of presentation vehicles on a computer screen, thereby minimizing clutter and providing more relevant search results to end-users.


In one embodiment, an updateable presentation vehicle comprises a pop-under displayed under a web browser in response to an end-user's search request to an original search engine. The pop-under may contain a search result from another search engine. As the end-user refines his search, a client program (e.g., message delivery program 200) updates the same pop-under to contain the latest search results from the other search engine, for example. By using the same pop-under for subsequent search results, the number of pop-unders provided to the end-user is thus minimized.



FIGS. 9(
a)-9(d) schematically illustrate a pop-under 910 (i.e., 910-1, 910-2, 910-3) in accordance with an embodiment of the present invention. In FIGS. 9(a)-9(d), pop-under 910 is labeled as 910-1, 910-2, or 910-3 to distinguish pop-under 910 according to its content. That is, 910-1, 910-2, and 910-3 refer to the same pop-under with different contents. Pop-under 910 may be any type of presentation vehicle that is not immediately available for viewing by the end-user. It should be noted, however, that the present invention is not limited to the use of pop-unders. As will be further described below, embodiments of the present invention may be adapted for use with other types of presentation vehicles.


In FIG. 9(a), pop-under 910-1 is under a web browser 901. Web browser 901 may be a commercially available web browser such as the Microsoft Internet Explorer™. web browser, for example. Other types of windows capable of displaying information received over a computer network may also be used in lieu of a web browser.


Still referring to FIG. 9(a), web browser 901 contains a search result 903 that is in response to a search request submitted by the end-user to an original search engine. In this example, the original search engine is the fictitious search engine having the URL address “www.finderskeepers.com”. Also in this example, the search request is for the keyword “computer”. The original search engine performs a search for the keyword “computer”, and provides search result 903. Note that search engines in general may comprise a single server computer or a network of server computers. For example, one server computer may be providing a user-interface or serve as a portal for the search engine, while another server computer may be performing the actual search.


As before, message delivery program 200 (see FIG. 3) initiates a search for the same keyword (i.e., “computer”) and provides a search result that is displayed in pop-under 910-1. Message delivery program 200 may submit the keyword “computer” to another search engine (not the original search engine, which is finderskeepers.com in this example) that may post a search result on a web page. Message delivery program 200 may then display pop-under 910-1 such that it is pointed to that web page containing the search result.


It is to be noted that as used in the present disclosure, the terms “over”, “overlying”, “under”, and “underlying” refer to the placement of a window that may or may not be directly above or below another window on a computer screen. For example, another window, such as another web browser or a folder, may be placed between web browser 901 and pop-under 910-1. Pop-under 910 is depicted in FIGS. 9(a), 9(b), and 9(c) with a dashed line to indicate that it is under web browser 901.


In the prior art, pop-unders are not normally used for displaying search results. This may be because a search result is typically something an end-user requests for, and is thus conventionally thought of as having to be displayed for immediate viewing by the end-user. In embodiments of the present invention, a pop-under advantageously provides an end-user a second search result while minimizing interruptions to the end-user by displaying the pop-under for later viewing. The second search result may be from search engines not necessarily affiliated with the original search engine. Thus, the search result from the original search engine will most likely be different from the second search result displayed in the pop-under, providing the end-user with a more comprehensive search.


In FIG. 9(b), the end-user refines his search by submitting a search request for the keywords “laptop” and “computer”. In response, the original search engine provides a search result 904. Pop-under 910, now labeled 910-2, is updated by message delivery program 200 to contain a new search result (not shown), this time for the keywords “laptop” and “computer”. Unlike pop-unders that are created once and stay the same until closed by the end-user, pop-under 910 may be updated to contain more relevant content. In this example, pop-under 910 is updated to contain the most recent search result, thus minimizing proliferation of windows on the end-user's computer screen.


In FIG. 9(c), the end-user refines his search once again by submitting the keywords “laptop”, “computer”, and “prices” to the original search engine. The original search engine responds to the new search request by providing a search result 905. Pop-under 910, now labeled 910-3, is updated by message delivery program 200 to contain the latest search result, which is responsive to the search request for the keywords “laptop”, “computer”, and “prices”.



FIG. 9(
d) schematically shows how pop-under 910-3 may look like after web browser 901 and other overlying windows are closed, re-arranged, or minimized. In FIG. 9(d), pop-under 910-3 displays a content 912, which is a search result for the keywords “laptop”, “computer”, and “prices”. Pop-under 910 may be updated with another content should the end-user decide to submit another search request.


Referring now to FIG. 10, there is shown a flow diagram of a method 1010 of displaying information received over a computer network in accordance with an embodiment of the present invention. In step 1012, a client program (e.g., a message delivery program 200) detects a first search request submitted by an end-user to an original search engine. In response, the original search engine provides a search result referred to as an “original search result”. As is conventional, the original search result may be displayed in the same web browser employed by the end-user to submit the search request.


In step 1014, the client program displays a first search result responsive to the first search request. The first search result may be displayed in a pop-under, which is not viewable until the end-user clears away overlying windows. That is, the first search result may be displayed under the web browser containing the original search result. The first search result may be generated by a single server computer (e.g., a message server computer 103) or a network of server computers that include a search engine.


In step 1016, the client program detects a second search request submitted by the end-user. The second search request may be submitted to the same original search engine or to another original search engine. The second search request may be a refinement of the first search request, or a completely new, unrelated search request.


In step 1018, the client program updates the same pop-under (that used to contain the first search result) to display a second search result responsive to the second search request. For example, the second search result may be posted on the same web page where the first search result was posted. The pop-under, which still points to the same web page, may then be refreshed to display the second search result.


As can be appreciated from the foregoing, an updateable presentation vehicle is useful in applications other than displaying of search results. For example, an updateable pop-up may be employed to display the most current, relevant content. This is in contrast to the conventional way of creating separate pop-ups for different contents.



FIG. 11 shows a flow diagram of a method 1100 of displaying information received over a computer network in accordance with an embodiment of the present invention. In step 1102, a client program (e.g., a message delivery program 200) detects a first end-user behavior. An end-user behavior may be the submission of a search request to an original search engine as described above, or some other activity that an end-user engages in while on the network. For example, an end-user behavior may be navigation from one web site to another web site. The navigation to a particular web site may trigger the client program to initiate delivery of message units to the client computer employed by the end-user. The message units may call for the use of a pop-up or some other presentation vehicle to display advertising or other types of information.


In step 1104, the client program displays a first content in a presentation vehicle in response to the first end-user behavior. For example, the client program may initiate displaying of a search result, an advertisement, or other types of information in the presentation vehicle.


In step 1106, the client program detects a second end-user behavior.


In step 1108, the client program updates the same presentation vehicle with a second content that is responsive to the second end-user behavior. For example, the client program may initiate display of a car advertisement in a pop-up when the end-user navigates from one web site to a car-related web site, and then initiate display of a wine advertisement in the same pop-up when the end-user navigates from the car-related web site to a wine-related web site.


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. Thus, the present invention is limited only by the following claims.

Claims
  • 1. A computer-implemented method to be performed, at least in part, by hardware in combination with software in a server computer, the method comprising: receiving from a message delivery program on a client computer a first keyword submitted by a web browser on the client compute to an original search engine, the original search engine not being a part of the server computer, the web browser being separate from the message delivery program; andproviding the client computer a first search result that is different from a search result provided by the original search engine.
  • 2. The method of claim 1 wherein the message delivery program is browser independent.
  • 3. The method of claim 1 wherein the original search engine is an internet search engine.
  • 4. The method of claim 1 further comprising: receiving from the client computer a second keyword submitted to the original search engine; andproviding the client computer a second search result that is different from another search result provided by the original search engine.
  • 5. The method of claim 4 wherein the first search result is displayed in a presentation vehicle that is updated to display the second search result.
  • 6. The method of claim 5 wherein the presentation vehicle comprises a pop-under.
  • 7. The method of claim 5 wherein the presentation vehicle comprises one or more of: a pop-up, a pop-under, a banner, a message box, a text box, a slider, a separate window, and a window embedded in a web page.
  • 8. An apparatus for receiving information over a computer network, the apparatus comprising: a client computer configured to submit, by a browser, a first search request and to receive a first search result and a second search result responsive to the first search request, the first search result to be displayed in a first window and a second search result to be displayed in a second window, the first window being displayed in the browser, the second window being displayed in a presentation vehicle separate from the browser.
  • 9. The apparatus of claim 8 wherein the second window is displayed under the first window.
  • 10. The apparatus of claim 8 wherein the client computer is further configured to receive a third search result that is responsive to another search request, the third search result is to be displayed in the second window.
  • 11. The apparatus of claim 10 wherein the first window comprises a web browser pointed to a search engine and the second window comprises a pop-under.
  • 12. A computer-implemented method of presenting information to an end-user in a computer network, the method being implemented, at least in part, by hardware in combination with software, the method comprising: detecting a first end-user behavior in a browser;displaying a first content in a presentation vehicle separate from the browser, the first content being responsive to the first end-user behavior;detecting a second end-user behavior; andupdating the presentation vehicle with a second content responsive to the second end-user behavior.
  • 13. The method of claim 12 wherein the presentation vehicle comprises one or more of: a pop-up, a pop-under, a banner, a message box, a text box, a slider, a separate window, and a window embedded in a web page.
  • 14. A computer-readable medium, the computer-readable medium comprising executable instructions, the instructions executable by a processor to perform operations comprising: receiving from a message delivery program on a client computer a first keyword submitted by a web browser on the client computer to an original search engine, the original search engine not being a part of the server computer, the web browser being separate from the message delivery program; andproviding the client computer a first search result that is different from a search result provided by the original search engine.
  • 15. The method of claim 12 wherein the first content comprises a first search result and the second content comprises a second search result.
  • 16. The method of claim 12 wherein the first end-user behavior comprises submitting a first search request and the second end-user behavior comprises submitting a second search request.
  • 17. The method of claim 16 wherein the first search request is submitted to a first search engine.
  • 18. The method of claim 17 wherein the first search engine is an Internet search engine.
  • 19. The method of claim 16 wherein the first search request and the second search request are submitted to the same search engine.
  • 20. The method of claim 12 wherein the first end-user behavior comprises navigating to a first web page and the second end-user behavior comprises navigating to a second web page.
  • 21. The method of claim 20 wherein the first content is distinct from the first web page and the second web page, and wherein the second content is distinct from the first web page and the second web page.
  • 22. The method of claim 12 wherein the presentation vehicle is browser independent.
  • 23. The method of claim 12 wherein the presentation vehicle operates independent of the browser.
  • 24. The method of claim 12 wherein the first end-user behavior comprises submitting a first search request to a first search engine, and the second end-user behavior comprises submitting a second search request to the first search engine, and wherein: the first content is distinct from a first search result from said first search engine in response to said first search request andthe second content is distinct from a second search result from said first search engine in response to said second search request.
  • 25. The method of claim 12 wherein: the first end-user behavior is one of: (i) submitting a first search request; and (ii) navigating to a first web page; and whereinthe second end-user behavior is one of: (iii) submitting a second search request; and (iv) navigating to a second web page.
  • 26. The method of claim 12 wherein detecting the first end-user behavior is performed using a program operating separately from the browser.
  • 27. The method of claim 12 wherein one of the first end-user behavior and the second end-user behavior comprises navigating to a specific web page, and wherein one of the first content and the second content was selected based, at least in part, on a domain name of the specific web page.
  • 28. The computer-readable medium of claim 14 wherein the message delivery program is browser independent.
  • 29. The computer-readable medium of claim 14 further comprising instructions executable by a processor to perform: receiving from the client computer a second keyword submitted to the original search engine; andproviding the client computer a second search result that is different from another search result provided by the original search engine.
  • 30. The computer-readable medium of claim 29 wherein the first search result is displayed in a presentation vehicle that is updated to display the second search result.
  • 31. The computer-readable medium of claim 30 wherein the presentation vehicle comprises a pop-under.
  • 32. A computer-readable medium, the computer-readable medium comprising executable instructions, the instructions executable by a processor to perform operations comprising: detecting a first end-user behavior in a browser;displaying a first content in a presentation vehicle separate from the browser, the first content being responsive to the first end-user behavior;detecting a second end-user behavior; andupdating the presentation vehicle with a second content responsive to the second end-user behavior.
  • 33. The computer-readable medium of claim 32 wherein the first end-user behavior comprises submitting a first search request and the second end-user behavior comprises submitting a second search request.
  • 34. The computer-readable medium of claim 32 wherein the first content comprises a first search result and the second content comprises a second search result.
  • 35. The computer-readable medium of claim 32 wherein the first end-user behavior comprises navigating to a first web page and the second end-user behavior comprises navigating to a second web page.
  • 36. A computer-implemented method, implemented at least in part by hardware in combination with software, the method comprising: receiving from a client computer a first keyword, said first keyword having been submitted on the client computer to a first search engine, the first search engine being distinct from a first server computer; andin response to said receiving, said first server computer providing the client computer first message content,wherein said first message content is distinct from a search result provided by said first search engine in response to said first keyword having been submitted to said first search engine.
  • 37. The method of claim 36 wherein the first keyword is received from a message delivery program on the client computer.
  • 38. The method of claim 37 wherein the message delivery program is browser independent.
  • 39. The method of claim 36 wherein the first message content comprises at least one of: video content, audio content, and program code.
  • 40. The method of claim 39 wherein; when the first message content includes displayable message content, the displayable message content is processed by displaying the displayable message content on a computer screen, andwhen the first message content includes computer-readable program code, the message content is processed by running the program code.
  • 41. A computer-implemented method, implemented, at least in part, by hardware in combination with software, the method comprising: responsive to a first end-user behavior in a browser on a computer device, presenting a first message content in a presentation vehicle on said computer device, the presentation vehicle being separate from the browser;responsive to a second end-user behavior on the computer device, updating the presentation vehicle with a second message content responsive to the second end-user behavior, wherein:the first end-user behavior comprises at least one of: (i) submitting a first search request; and (ii) navigating to a first web page; and whereinthe second end-user behavior comprises at least one of: (iii) submitting a second search request; and (iv) navigating to a second web page, and whereinthe first message content comprises at least one of: first video content, first audio content, and first program code, and whereinthe second message content comprises at least one of: second video content, second audio content, and second program code.
  • 42. The method of claim 41 wherein the presentation vehicle is separate from a browser.
  • 43. The method of claim 41 wherein the presentation vehicle comprises one or more of: a pop-up, a pop-under, a banner, a message box, a text box, a slider, a separate window, and a window embedded in a web page.
REFERENCE TO RELATED APPLICATION

This application seeks priority to and is a continuation of U.S. application Ser. No. 10/462,574, filed on Jun. 16, 2003, entitled “Updating the Content of a Presentation Vehicle in a Computer Network,” filed by Anthony G. Martin, Scott Vandevelde, and David L. Goulden, published Jun.24, 2004 as U.S. Publication No. 2004-0122808, and issued on Oct.14, 2009 as U.S. Pat. No. 7,603,341, which is a continuation-in-part of U.S.application Ser. No. 10/289,123, filed on Nov. 05, 2002 issued as U.S Pat. No. 7,512,603, entitled “Responding to End-User Request for Information in a Computer Network,” issued on May 31, 2009, by Eugene A. Veteska, David L. Goulden, and Anthony G. Martin, which are both incorporated herein by reference in entirety. U.S. application Ser. No. 10/462,574, filed on Jun. 16, 2003, entitled “Updating the Content of a Presentation Vehicle in a Computer Network,” (U.S. Pat. No. 7,603,341) also claimed benefit of U.S. Provisional Application No. 60/457,524, entitled “Updating the Content of a Presentation Vehicle in a Computer Network,” filed by Scott Vandevelde, David L. Goulden, and Anthony G. Martin on Mar. 25, 2003, which is incorporated herein by reference in its entirety.

US Referenced Citations (785)
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 Radziewicz 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
6055573 Gardenswartz et al. 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 Petelcyky 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
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 Jan 2002 A1
20020007307 Miller 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
20020046087 Hey 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
20030206720 Abecassis Nov 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 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
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 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 (39)
Number Date Country
0631231 Dec 1994 EP
0822535 Feb 1998 EP
1045547 Oct 2000 EP
1154611 Nov 2001 EP
1207468 May 2002 EP
343825 Feb 1991 JP
11066099 Mar 1999 JP
2001084256 Mar 2001 JP
2001147894 May 2001 JP
20010222535 Aug 2001 JP
2001312482 Nov 2001 JP
2002024221 Jan 2002 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
WO0190917 Nov 2001 WO
WO 0244869 Jun 2002 WO
WO 03010685 Feb 2003 WO
Related Publications (1)
Number Date Country
20100179947 A1 Jul 2010 US
Provisional Applications (1)
Number Date Country
60457524 Mar 2003 US
Continuations (1)
Number Date Country
Parent 10462574 Jun 2003 US
Child 12577702 US
Continuation in Parts (1)
Number Date Country
Parent 10289123 Nov 2002 US
Child 10462574 US