System and method for optimizing online marketing based upon relative advertisement placement

Information

  • Patent Grant
  • 12243075
  • Patent Number
    12,243,075
  • Date Filed
    Friday, May 26, 2023
    a year ago
  • Date Issued
    Tuesday, March 4, 2025
    2 months ago
  • CPC
  • Field of Search
    • CPC
    • G06Q30/0256
  • International Classifications
    • G06Q30/02
    • G06Q30/0251
    • Disclaimer
      This patent is subject to a terminal disclaimer.
      Term Extension
      3
Abstract
A method for optimizing target content on a search results webpage includes receiving source code defining the webpage from a search engine server. The method further includes processing the source code to identify a target source code block in the source code, the target source code block defining, at least partially, the target content. The method further includes processing the target source code block to determine a relative metric for the target content with respect to a layout of the search results webpage. Thereafter, the relative metric may be utilized to optimize advertising expenditures in order to improve a relative position of the target content.
Description
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable.


BACKGROUND
1. The Field of the Present Disclosure

The present disclosure relates generally to electronic commerce (“e-commerce”), and more particularly, but not necessarily entirely, to systems and methods for optimizing online content displayed on webpages, including advertisements and search results listings.


2. Description of Related Art

Business conducted over the Internet, generally referred to as e-commerce, has grown dramatically with the proliferation of consumer electronic devices. Typically, online businesses conduct e-commerce with users through e-commerce websites made available on the Internet. To increase web traffic, online businesses often optimize their e-commerce websites to increase their rankings in online search results generated by search engines. These type of searches performed by search engines are often referred to as “natural” search results. The process of increasing one's ranking in natural search results is commonly referred to as search engine optimization (SEO).


In addition, online businesses can increase traffic to their e-commerce websites by paying an advertising fee to a search engine operator for top placement in “paid” search results. Usually, an online business can increase the ranking of its e-commerce website in paid search results by paying a higher advertising fee or bid to the search engine operator. Popular search engines includes Google, Bing, and Yahoo. Search engines often display a mix of both natural search results and paid search results on a single search result webpage. Most search engines make it easy for online users to distinguish between natural search results and paid search results displayed on the same webpage.


While high search rankings do not guarantee success, they are a key metric that many online businesses use as a way to measure market exposure. In the past, even a drop of a few ranks in the search results may result in a significant decrease in web traffic. Thus, many online businesses continuously conduct SEO audits to obtain a benchmark of paid and natural search results rankings for critical keywords.


Actual search engine rankings, however, may be difficult to determine for various reasons. First, search engine algorithms are increasingly providing personalized search results-meaning that two different users using the same keywords in an online search may see different search results. Second, search engine algorithms are increasingly taking into account the physical locations of users to provide local listings. To address these problems, SEO audits may determine search results rankings by averaging the results of multiple searches conducted by proxy computers positioned at various geographic locations. In this manner, online businesses may obtain an average benchmark of their website rankings in search results.


Increasingly, however, online businesses have observed that search engine rankings are becoming less relevant in driving web traffic to their websites. This phenomenon primarily stems from the fact that search engine operators have become more proactive in providing new variations to the traditional search results templates utilized to present search results to users. These new search results templates simply do not guarantee a prominent placement on the search results webpage even for websites that have the top rankings in the natural search results and/or the paid search results. For example, while the highest ranked search results may be on the first page of the search results, they may be displayed below the user's initial view area such that the user must scroll down to see them.


Thus, while search results rankings likely will remain an important metric for determining online marketing exposure, improved metrics are needed to optimize search results and advertisement placement. It would therefore be an improvement of the art to provide improved metrics for optimizing online exposure. It would be a further improvement to provide improved metrics for optimizing the placement of advertisements, e.g., banner ads, on webpages.


The features and advantages of the present disclosure will be set forth in the description that follows, and in part will be apparent from the description, or may be learned by the practice of the present disclosure without undue experimentation. The features and advantages of the present disclosure may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the disclosure will become apparent from a consideration of the subsequent detailed description presented in connection with the accompanying drawings in which:



FIG. 1 is a block diagram of an advertising optimization system according to an embodiment of the present disclosure;



FIG. 2 is a flow diagram of a process for optimizing online marketing by determining a relative metric for target content on a search results webpage generated by a search engine;



FIG. 3 is a flow diagram of a process for optimizing online marketing by determining a relative metric for target content on a webpage generated by a webpage server;



FIG. 4 is an exemplary search results webpage generated by a search engine server;



FIG. 5 is the exemplary search results webpage shown in FIG. 4 that indicates the relative size of the target content; and



FIG. 6 is the exemplary search results webpage shown in FIG. 4 that indicates the relative position of the target content.





DETAILED DESCRIPTION

For the purposes of promoting an understanding of the principles in accordance with the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe them. It will nevertheless be understood that no limitation of the scope of the disclosure is thereby intended. Any alterations and further modifications of the inventive features illustrated herein, and any additional applications of the principles of the disclosure as illustrated herein, which would normally occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the disclosure claimed.


In describing and claiming the present disclosure, the following terminology will be used in accordance with the definitions set out below. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” include plural referents unless the context clearly dictates otherwise. As used in this specification and the appended claims, the terms “comprising,” “including,” “containing,” “having,” “characterized by,” and grammatical equivalents thereof are inclusive or open-ended terms that do not exclude additional, unrecited elements or method steps.


Various illustrative embodiments of the present invention, for example, advantageously provide systems, computer-readable media, programs, and methods for optimizing online marketing based on the relative sizes of selected online content, referred to herein as “target content.” In an illustrative embodiment, the present invention determines the size of target content by using HTML tags specifying where the target content starts and ends on search results webpages. In an illustrative embodiment, the present invention determines the sizes of the target content based on the sizes of the boxes defined by the source code for the target content. In an illustrative embodiment, the present invention also determines the sizes of the search results pages based on the source code of the search results pages. The relative size of the target content may be based on the size of the target content and the size of the search results pages. For example, in an illustrative embodiment, the present invention may determine the relative size of the target content by dividing the size of the target content by the size of the search results page. In an illustrative embodiment, the present invention may express the relative size of the target content by a numerical value, such as a percentage or some other value.


Various illustrative embodiments of the present invention, for example, advantageously provide systems, computer-readable media, programs, and methods for optimizing online marketing based on the relative position of target content on a webpage. For example, the present invention may determine the relative position of listings in search results generated by a search engine server by determining the distances of the listings from a predetermined location on the search result webpage.


Systems, computer-readable media, programs, and methods of the present invention may determine a distance of the listings relative to the display pixel located at the (1,1) pixel coordinate of the search results webpage. It will be appreciated, however, that the relative position of the listings in the search results may be determined relative to any location on the webpage.


Based either partially or wholly on the relative size and placement information, the systems, computer-readable media, programs, and methods of the present invention may further determine if the target listings on the search results are optimal on the search results webpages. In an illustrative embodiment, the present invention determines if the target listings in the search results are within the users' initial view area of the search results webpage as shown on the displays of the users' computers. In an illustrative embodiment, the present invention may determine if the target listings in the search results are out of the users' initial view area of the search results webpage on the displays of the users' computer.


The systems, computer-readable media, programs, and methods of the present invention may further optimize online content by recommending increasing or decreasing advertising expenditures. In an illustrative embodiment, the present invention may recommend increasing spending on paid search results if the relative size or placement of target listings in the search results generated by a search engine is undesirable. This may be true even where the target listings are highly ranked in the search results. In an embodiment, the present invention may recommend decreasing spending on paid search results if the relative size or placement of target listings in the search results generated by a search engine is desirable.


The systems, computer-readable media, programs, and methods of the present invention may further be utilized to optimize online advertisements, such as banner ads, on webpages. In an illustrative embodiment, the present invention determines the sizes of target advertisements by using the source coding for the webpages, which specifies where the target advertisements start and end on the webpages.


In an illustrative embodiment, the present invention determines the sizes of the target advertisements based on the sizes of the boxes defined by HTML tags in the source coding. In an illustrative embodiment, the present invention determines the sizes of the webpages based on the source code of the webpages. The relative sizes of the target advertisements are based on the size of the target advertisements and the size of the webpages. For example, in an illustrative embodiment, the present invention may determine the relative size of a target advertisements by dividing the size of the target advertisement by the size of the webpage. In an embodiment, the present invention may express the relative sizes of target advertisements by a numerical value, such as a percentage or some other value.


Various illustrative embodiments of the present invention, for example, advantageously provide systems, computer-readable media, programs, and methods for optimizing online marketing based upon the relative placement of target advertisements on webpages. In an illustrative embodiment, the present invention may determine the relative placement of target advertisements on webpages by determining the distances of the target advertisements from a predetermined location on the webpage. For example, systems, computer-readable media, programs and methods of the present invention may determine a distance of target advertisements relative to a display coordinate located at (1,1). It will be appreciated, however, that the relative placement of the target advertisements may be determined relative to any display coordinate (x,y) on a webpage.


Various illustrative embodiments of the present invention, for example, advantageously provide systems, computer-readable media, programs, and methods for determining an advertising rate based on the relative size or relative placement of target content on a webpage. In an illustrative embodiment, the target content is one of a listing in paid search results and a banner-type advertisement on a webpage. In particular, the systems, computer-readable media, programs, and methods of the present invention may determine advertising rates for target content based on a distance relative to a predetermined location on the webpages.


In an illustrative embodiment, systems, computer-readable media, programs, and methods of the present invention may determine advertising rates based on the relative sizes of the online advertisements compared to the webpages or a portion of the webpages.


Various illustrative embodiments of the present invention, for example, advantageously provide systems, computer-readable media, programs, and methods for allowing online advertisers to place bids for advertising based on the relative size or relative placement of advertising, such as banner ads or paid search results, on a webpage. For example, in an illustrative embodiment, the advertisement for the online advertiser with the highest bid for a keyword may be given optimal placement relative to a predetermined position on a webpage. In another illustrative embodiment, the advertisement for the online advertiser with the highest bid for a keyword may be allocated the largest relative size on a webpage.


Referring now to FIG. 1, there is depicted a block diagram of an exemplary optimization system 100 according to an illustrative embodiment of the present disclosure. The system 100 may include a server 101 having a processor 102 coupled to a memory 104. It will be appreciated that the processor 102 may comprise multiple processors.


Loaded in the memory 104 are programs containing computer-readable instructions that are executable by the processor 102. The programs include an operating system 108 as is known to those having skill in the art. In addition, the programs further include a content optimization program 110. The program 110 comprises computer-readable instructions that, when executed by the processor 102, cause the processor 102 to carry out the functionality and features of the system 100 described herein. As known to those of ordinary skill, a user may enter commands and information into the server 101 through input devices such as a keyboard and a pointing device, such as a mouse (not shown).


In an illustrative embodiment, the server 101 comprises a collection of computer servers, each having its own processor or processors that are connected to an internal, or external, network in what is commonly referred to as a “server farm,” with each server performing unique tasks or the group of servers sharing the load of multiple tasks. Each server of a server farm includes a processor coupled to a memory. The server farm is scalable as is known to those skilled in the art to accommodate large demand on the server 101.


In an illustrative embodiment, the server 101 may be part of an e-commerce enterprise for selling products over the Internet. The e-commerce enterprise may include an e-commerce server (not shown) that provides an e-commerce website on the Internet. Associated with the e-commerce enterprise are keywords that are utilized by the enterprise to drive traffic to the e-commerce website. For example, the keywords may be utilized by users to form keyword searches on an Internet search website.


In an illustrative embodiment, the system 100 further includes a database 112 residing on an electronic storage medium. Stored in the database 112 are those keywords 114 of importance to an e-commerce enterprise. In particular, the keywords 114 stored in the database 112 may be those words or phrases that a user types into a search interface of a search engine website to find the e-commerce website hosted by the e-commerce enterprise, as is known to those of ordinary skill in the art. For example, the keywords may comprise keywords utilized in paid search marketing.


In an illustrative embodiment, the server 101 may be independent of an e-commerce enterprise. That is, the server 101 may provide its services to multiple third-parties over the Internet. For example, the operators of the server 101 may charge a fee to third-parties for accessing the optimization features provided by the server 101.


In an illustrative embodiment, the system 100 may include a computer network 118, such as the Internet. The computer server 101 is connected to the computer network 118 in a manner known to those having ordinary skill in the art. The system 100 may also include a search engine server 120 connected to the network 118. The server 101 may be able to access the features of the search engine server 120 over the network 118. In particular, the search engine server 120 may include a processor 122 and a memory 124. Stored in the memory 124 may be a search engine program 126. The search engine program 126 may be operable to generate a search engine interface webpage as is known to those having ordinary skill in the art. The search engine interface webpage may include a search box that allows users to define a keyword search query from remote user computers (not shown).


In response to the keyword search query entered by the user, the search engine program 126 may return a search results webpage that is displayed on the users' remote computers, as is known to those having ordinary skill in the art and not described in detail herein. Popular search engine servers include Google, Yahoo, Dogpile, and Bing.


The search engine server 120 may return search results in accordance with one or more templates created by the operator of the search engine server 120. The templates may include paid search results and natural search results. It will be appreciated that the system 100 may include a plurality of search engine servers, each operated by a different search engine operator.


As mentioned, the search engine server 120 may generate a search results webpage in response to a search query. More particularly, the search engine server 120 may generate HTML source code that defines the search results webpage. The source code may be generated by the search engine server 120 according to a template. A web browser running on a user's computer renders the search results page on the user's display from the source code. Blocks of source code may define each of the listings in paid search results and listings in natural search results. In particular, the blocks of source code may define the size, position, and content of each of the listings. Each of the blocks of source code may further include a specific uniform resource locator (“URL”), also known as a link or web address, which is displayed in the listing. A user may select the URL by clicking on the URL, which causes the user's web browser to be directed to the webpage indicated by the URL. The source code may further define other content for display on the search results webpage, including graphics, images, text boxes, and other content.


The system 100 may also include a website server 130 connected to the network 118. The server 101 may be able to access the features of the web site server 130 over the network 118. In particular, the web site server 130 may include a processor 132 and a memory 134. Stored in the memory 134 may be a web server program 136. The web server program 136 may be operable to generate webpages as is known to those having ordinary skill. The webpages generated by the web site server 130 may include a wide variety of content of interest to users. For example, the webpages may include social network content, news content, or any other content.


Disposed on the webpages generated by the web site server 130 may be advertisements in various forms, including banner ads. More particularly, the web site server 130 may generate HTML source code that defines webpages for display in a users' web browsers. The source code may be generated by the web site server 130 according to a template. Blocks of source code may define content that is to be displayed on the users' web browsers. In addition, the blocks of source code may define the advertisements, including the content, position, and size of the advertisements. Each of the blocks of source code may further include a specific uniform resource locator (“URL”), also known as a link or web address, which is displayed in association with the advertisements. A user may select the URL by clicking on the advertisements, which causes the user's web browser to be directed to the webpage indicated by the URL.


It will be appreciated that as used herein, the term “target content” refers to content of interest that is displayable on a webpage. Target content may include, without limitation, listings in paid search results, listings in natural search results, and online advertisements, such as banner ads and the like. It will further be appreciated that “target source code” is a block of code in the webpage source code. The target source code is rendered by a web browser to display the target content on a user's display.


Referring now to FIG. 2, there is a flow chart according to a process 200 performed by the system 100, and in particular, the processor 102 of the server 101 shown in FIG. 1. In particular, the processor 102 may execute the computer-readable instructions of the program 110 stored in the memory 104 of the server 101 to accomplish the steps shown in the flowchart depicted for the process 200.


At step 202, server 101 may automatically fetch one or more keywords from the database 112. In an illustrative embodiment, the one or more keywords may be manually entered into the server 101 by a user. Typically, the keywords are those keywords utilized by e-commerce operations to drive traffic to their associated websites. At step 204, the server 101 forms a search query on a search request interface generated by the search engine server 120. In this regard, the server 101 may automatically access the search engine request interface at a pre-designated URL. The server 101 then automatically populates the search box with one or more of the keywords and then causes the search to be performed by the search engine server 120. It will be appreciated that, as used herein, a “keyword” may include a keyword phrase comprising multiple words.


At step 206, the server 101 receives the source coding for the target webpage, which is a search results webpage generated by the search engine server 120. The search results webpage may comprise search results responsive to the search request defined by the keyword. In an illustrative embodiment, the source coding for the search results webpage may comprise blocks of source code that define the listings in the paid search results and natural search results. The source code for the search results webpage may further define additional content for display on a user's computer as determined by the designated search results template utilized by the search engine server 120. The additional content may include graphics, images, webpage features, and advertisements.


At step 208, the server 101 identifies blocks of target source code in the source coding of the search results webpage. In particular, the target source code may define target content, e.g., target listings, that occurs in the paid search results and the natural search results. Typically, but not necessarily, the identification of the target source coding includes matching text in the source coding to a predetermined word, phrase, URL, or text string.


In an illustrative embodiment, the content matching performed by the server 101 may include matching content in the source coding to a URL of an e-commerce website. For example, the URL may be a web address or link to a product webpage of a website hosted by an e-commerce server. When the server 101 finds a match in the source coding, the server 101 may parse a block of source coding, i.e., the target source code, from the source coding of the search results webpage. That is, the server 101 may extract the target source code for further processing. In an illustrative embodiment, the parsed target source code may include some, or all, of the source coding that defines the targeted content.


At step 210, the server 101 generates a relative metric for the target content with respect to a layout the search results webpage. In an illustrative embodiment, the relative metric is the relative display size of the target content with respect to search results webpage. In particular, using the information in the target source code, the server 101 determines a size of the target content on the search results webpage. For example, the server 101 may determine the height and width of the target content in pixels and then determines the area (height×width) of the target content on the search results webpage.


Then, from the source coding, the server 101 determines the display size of the entire search results webpage. For example, the server 101 may determine the height and width of the entire search results webpage and then determine its area (height×width). The server 101 then uses the size of the target content and the size of the search results webpage to calculate a relative metric. In an illustrative embodiment, the server 101 divides the size of the target content by the size of the search results webpage to define a percentage that represents the relative size of the target content with respect to the search results webpage.


In an illustrative embodiment, the server 101 may determine the relative metric based on the size of the target content with respect to only a portion of the search results webpage. For example, the portion of the search results webpage may be the portion of the webpage that appears in the initial view area on the display of the user's computer. In this case, the server 101 divides the size of the target content by the size of the initial view area of the search results webpage to define a percentage that represents the relative size of the target content with respect to the initial view area.


It will be appreciated that the initial view area refers to that portion of the search results webpage that is first viewable to a user without scrolling. That is, a search result webpage may be larger than a display area in a web browser. In this case, the web browser may automatically generate a user interactive scroll bar that allows a user to scroll down to view that portion that is not initially viewable.


In the above manner, the server 101 is able to determine a footprint of the target content on either, or both of, the entire search results webpage, or just the portion of the search results webpage that appears in the initial view area.


In an illustrative embodiment, the relative metric determined by the server 101 is defined by a distance of the target content from a predetermined location on the search results page. For example, the server 101 may determine a distance of target conduct from a predetermined location on the search results page. A good choice for the predetermined location is the (1,1) pixel on the search results page, which is located at the top, left corner of the search results webpage in a user's web browser. The distance of the target content may be determined from a pixel of the target content located anywhere in the target content. In an illustrative embodiment, the server 101 determines and stores in the database 112 both the relative size(s) and relative distance of the target content as relative metric data 116 as shown in FIG. 1.


It will be appreciated that the relative metric may be determined by the server 101 using data from a plurality of searches conducted by proxy computers located throughout a geographic region. In an illustrative embodiment, the server 101 averages the relative metrics for each of the searches conducted by the proxy servers to get a clear snapshot of the target content. As mentioned above, the search engine server 120 may provide different search results for the same keyword based on search personalization and geographic location. Thus, averaging the relative metrics across searches performed by multiple proxy computers will provide a more accurate snapshot of the relative metrics for the target content. In an illustrative embodiment, the server 101 may average over 100; 1,000; or 10,000 searches conducted by proxy in order to determine an average of the relative metric. The relative metric determined by the server 101 may be stored in association with the keyword utilized to form the pertinent search query. In addition, the server 101 may store information on the rankings of the target content in the paid or natural search results. Thus, at step 212, the relative metric for the target content is stored in the database 112.


At step 214, the server 101 makes recommendations to optimize online marketing based on the relative metric(s). For example, if the relative metric indicates that the relative size of the footprint of target content is small on the search results webpage, the server 101 may recommend that bids on the relevant keyword for paid search results be increased. Likewise, if the relative metric indicates that the relative size of the footprint of target content is large on the search results page, the server 101 may recommend that the bid on the relevant keyword for paid search results be decreased to prevent overpayment.


If the relative distance between the target content and a predetermined position on the search results webpage is large, the server 101 may recommend that bid on the relevant keyword for paid search results be increased to reduce the distance. Likewise, if the relative distance between the target content and a predetermined position on the search results webpage is small, the server 101 may recommend that bid on the relevant keyword for paid search results be decreased to prevent overpayment.


It will be appreciated that the server 101 may dynamically update the relative metrics for identified keywords according to a set schedule, including hourly, daily, or weekly. It will be appreciated that the server 101 may automatically increase or decrease bids for keywords utilized in paid search results based on the relative metrics determined by the server 101.


Referring now to FIGS. 4, 5, and 6, there is depicted an example of a process for determining relative metrics for target content on an exemplary search results webpage 250 generated by a search engine server. The process may be performed by the server 101 shown in FIG. 1. By way of background, the search results page 250 includes a search bar 252 that displays the keyword utilized to generate the search results. In this case, the keyword used to generate the search results is “curtains.” The search results page 250 may include paid search results 254 directly beneath the search bar 252. Below the paid search results 254 are local listings 256 deemed to be relevant to the keyword by the search engine server. In particular, the local listings 256 may be locations near the user's location that offer curtains for sale.


Located to the right of the paid search results 254 and local listings 256 are images 260 generated by the search engine server in response to the keyword. The images 260 may be selectable by a user to link the user to the webpage that hosts the images. Located below the local listings 256 are the natural search results 258. Because of the size of the webpage 250, the entire webpage may not be displayed on a display of a user's computer at the same time. The dashed line 262 indicates the initial view area of the webpage 250. To see below the dashed line 262, a user must scroll down.


The search results webpage 250 may be generated by a search engine server in response to a keyword search query defined by the server 101. In response to the keyword search query, the search engine server may return the source coding for the webpage 250 to the server 101. It will be appreciated that the server 101 may not actually render the source coding for display in a web browser. Instead, the server 101 may process the source coding to determine relative metrics of target content on the webpage 250.


In this regard, the server 101 may first search the source coding of the webpage 250 to find a match to a predetermined text string. In an illustrative embodiment, the predetermined text string may be a web address. In the case of this example, the text string is www.overstock.com. As can be observed, this text string occurs in a listing in the paid search results and a listing in the natural search results. These listings are referred to herein as “target content.”


Once the server 101 finds a match in the source code, the server 101 then parses one or more blocks of source code that defines the target content from the source code. The server 101 then process the blocks of source code to determine the size of the target content on the search results page 250.


As seen in FIG. 5, the target content may include a first listing 270 and a second listing 272. From the parsed block of source code defining the first listing 270, the server 101 determines the size of the first listing 270 to be X2 by Y2 pixels. Likewise, from the parsed block of source code defining the second listing 272, the server 101 determines the size of the second listing 272 to be X3 by Y3 pixels. Using this information, the server 101 then determines the area of the first listing 270 and the second listing 272 by multiplying the dimensions. The server 101 may then determine the size of the webpage 250 from the source coding. In this case, the size of the webpage is X1 by Y1 pixels. The server 101 then determines the area of the webpage 250 by multiplying its dimensions.


The server 101 finds the relative sizes of the first listing 270 and the second listing 272 by dividing their area by the area of the webpage 250. The relative sizes of the listings 270 and 272 may be expressed as a percentage. Additionally, the server 101 may determine the size of the initial view area of the webpage 250 by determining its dimensions from the source coding, in this case, X1 by Y4 pixels. The relative size of the first listing 270 with regard to the initial view area may be determined by dividing the size of the first listing 270 by the size of the initial view area. Using these metrics, the server 101 is able to optimize advertising expenditures as described above.


Referring now to FIG. 6, the server 101 may also determine a relative position of the listings 270 and 272 from a predetermined position on the webpage 250. In this case, the predetermined position is the pixel 274 located at the (1,1) coordinate on the webpage 250. However, it will be appreciated that the predetermined position may be anywhere on the webpage 250. In particular, the distance of the first listing 270 may be determined between the pixel 274 and the pixel 276 and the distance of the second listing 272 may be determined between the pixel 274 and the pixel 278. Using these metrics, the server 101 is able to optimize advertising expenditures as described above.


Referring now to FIG. 3, there is a flow chart according to a process 300 performed by the system 100, and in particular, the processor 102 of the server 101 shown in FIG. 1. In particular, the processor 102 may execute the computer-readable instructions of the program 110 stored in the memory 104 of the server 101 to accomplish the steps shown in the flowchart depicted for the process 300.


At step 302, the server 101 may fetch a URL of a target webpage. In an illustrative embodiment, the target webpage may be hosted by the web server 130. The target webpage may comprise target content in the form of online advertisements of interest. At step 304, the server 101 requests the target webpage from the web server 130. At step 306, the source code for the target webpage as generated by the web server 130 is received at the server 101.


At step 308, the server 101 identifies and parses target source code for target content from the source code for the target webpage. In particular, the server 101 identifies blocks of target source code in the source code of target webpage. The target source code may define target content, e.g., advertisements, that occurs on the target webpage. Typically, but not necessarily, the identification of the target source coding includes matching text in the source coding to a predetermined word, phrase, URL, or text string. In an illustrative embodiment, the content matching performed by the server 101 may include matching text in the source coding to a URL of an e-commerce website. For example, the URL may be a web address or link to a product webpage of a website hosted by an e-commerce server.


When the server 101 finds a match in the source coding, the server 101 parses a block of source coding, i.e., the target source code. That is, the server 101 may extract the target source code for further processing. In an embodiment, the parsed target source code may include some, or all, of the source coding that defines the target content that is displayed on the target webpage.


At step 310, the server 101 generates a relative metric for the target content with respect to a layout of the target webpage. In an illustrative embodiment, the relative metric is the relative display size of the target content with respect to the target webpage. In particular, using the information in the target source code, the server 101 determines a size of the target content on the target webpage. For example, the server 101 may determine the height and width of the target content in pixels and then determines its area (height×width).


Next, from the source coding, the server 101 determines the display size of the entire target webpage. For example, the server 101 may determine the height and width of the entire target webpage and then determine its area (height×width). The server 101 then uses the size of the target content and the size of the target webpage to calculate the relative metric. In an illustrative embodiment, the server 101 divides the size of the target content by the size of the target webpage to define a percentage that represents the relative size of the target content with respect to the target webpage.


In an illustrative embodiment, the server 101 may determine the relative metric based on the size of the target content with respect to only a portion of the target webpage. For example, the portion of the target webpage may be the portion of the target webpage that appears in the initial view area on the display of the user's computer. In this case, the server 101 divides the size of the target content by the size of the initial view area of the target webpage to define a percentage that represents the relative size of the target content with respect to the initial view area. In this manner, the server 101 is able to determine a footprint of the target content on either, or both of, the entire target webpage, or just the portion of the target webpage that appears in the initial view area.


In an illustrative embodiment, the relative metric determined by the server 101 is defined by a distance of the target content from a predetermined location on the target webpage. For example, the server 101 may determine a distance of target conduct from a predetermined pixel location on the target webpage. As explained above, a good choice for the location is the pixel (1,1) on the target webpage. The distance of the target content may be determined from a pixel of the target content located anywhere in the target content.


In an illustrative embodiment, the server 101 determines and stores 312 in the database 112 both the relative size(s) and relative distance of the target content as relative metric data 116 shown in FIG. 1. As above, it will be appreciated that the relative metric may be determined by the server 101 from a plurality of searches conducted by proxy computers located throughout a geographic region.


At step 314, the server 101 makes recommendations to optimize online marketing based upon the relative metric(s). For example, if the relative metric indicates that the relative size of the footprint of target content is small on the target webpage, the server 101 may recommend an increase in advertising expenditure. Likewise, if the relative metric indicates that the relative size of the footprint of target content is overly large on the target webpage, the server 101 may recommend that advertising expenditures be decreased.


If the relative distance between the target content and a predetermined position on the search results webpage is large, the server 101 may recommend an increase in advertising expenditures to reduce the distance. Likewise, if the relative distance between the target content and a predetermined position on the target webpage is small, the server 101 may recommend a decrease in advertising expenditures to prevent overpayment. It will be appreciated that the server 101 may dynamically update the relative metrics for identified keywords according to a set schedule, including hourly, daily, or weekly. It will be appreciated that the server 101 may automatically increase or decrease advertising expenditures based on the relative metrics.


In an illustrative embodiment, relative metric information, such as relative size and relative position, may be utilized to determine advertising rates. For example, a higher bid for a keyword may result in a larger relative size or improved relative position on a search results webpage. In another example, a higher fee for paid advertising may result in a larger relative size or preferred placement on a webpage. Stated another way, using the relative metrics discussed herein, advertisements with a larger footprint on a webpage are charged higher rates than advertisements with a smaller footprint on a webpage. The relative metrics discussed herein may be utilized in SEO for keywords. In an embodiment, the relative metrics may be utilized to change a relative position of target content on a webpage. For example, SEO may occur depending on whether the relative metric is below or above a predetermined value. That is, the server 101 may compare a relative metric for target content to a predetermined value, or range, and recommend increasing or decreasing a keyword bid in order to change the relative position of the target content on a search results webpage generated by a search engine server. In an embodiment, the server 101 may repeat the process in iteration to obtain a desired relative metric.


In the foregoing Detailed Description, various features of the present disclosure are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed disclosure requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the following claims are hereby incorporated into this Detailed Description of the Disclosure by this reference, with each claim standing on its own as a separate embodiment of the present disclosure.


It is to be understood that the above-described arrangements are only illustrative of the application of the principles of the present disclosure. Numerous modifications and alternative arrangements may be devised by those skilled in the art without departing from the spirit and scope of the present disclosure and the appended claims are intended to cover such modifications and arrangements. Thus, while the present disclosure has been shown in the drawings and described above with particularity and detail, it will be apparent to those of ordinary skill in the art that numerous modifications, including, but not limited to, variations in size, materials, shape, form, function and manner of operation, assembly and use may be made without departing from the principles and concepts set forth herein.

Claims
  • 1. A method for determining the online exposure of a target webpage in search results, said method comprising: causing a content optimization server to receive source code from each of a plurality of proxy computers located throughout a geographic region through an online server, each defining a search results page from one of the plurality of proxy computers located throughout the geographic region, wherein the content optimization server comprises at least a processor;processing the source code from each of the plurality of proxy computers with the processor of the content optimization server to identify target source code in the source code for each of the plurality of proxy computers, wherein the content optimization server identifies blocks of target source code by matching text in the source code to predetermined code in the server;causing the content optimization server to parse one or more blocks of source code, each containing the target source code, wherein the parsed target source code includes at least some of the source code that defines target content displayed on the target webpage and used to identify the target webpage on the search results page;causing the processor of the content optimization server to determine a relative metric for each parsed block of target source code from each of the plurality of proxy computers by causing the processor of the content optimization server to determine the location of target content on the search results page by determining the distance of the target content from a predetermined location on the search results page;determining an overall relative metric as a measure of the online exposure of the target webpage in search results with the processor of the content optimization server by averaging the relative metric from each of the plurality of proxy computers;using the processor of the content optimization server to dynamically update the overall relative metric according to a selected schedule; andstoring the relative metric in a database.
  • 2. A system for determining the online exposure of a target webpage in search results, said system comprising: a processor;a memory coupled to the processor; andcomputer-readable instructions stored in the memory that, when executed by the processor, cause the processor to: (i) receive source code defining a search results page from a web server from each of a plurality of proxy computers located throughout a geographic region through an online server, (ii) identify a target source code block in the source code for each of the plurality of proxy computers by matching text in the source code to predetermined code stored in the server, the target source code block defining, at least partially, target content on the target webpage, (iii) identify HTML tags specifying where target content starts and ends on the search results page for each of the plurality of proxy computers, (iv) determine the distance of the target content from a predetermined location on the search results page for each of the plurality of proxy computers, (v) determine a relative metric for the target content for each of the plurality of proxy computers based on the distance of the target content from a predetermined location on the search results page, (vi) average the relative metric for each of the plurality of proxy computers located throughout a geographic region to determine an overall relative metric as a measure of the online exposure of the target webpage in search results, (vii) store the overall relative metric in a database, and (viii) dynamically update the overall relative metric according to a selected schedule.
  • 3. A method for analyzing a webpage, said method comprising; causing a content optimization server to receive source code from an online server defining the webpage from each of a plurality of proxy computers located throughout a geographic region, wherein the content optimization server comprises at least a processor;using the processor of the content optimization server to process the source code from each of the plurality of proxy computers located throughout a geographic regions to identify target source code in the source code from each of the plurality of proxy computers located throughout the geographic region, wherein the content optimization server identifies blocks of target source code by matching text in the source code to predetermined code in the server, the target source code defining, at least partially, a search result on the webpage;causing the content optimization server to parse one or more blocks of source code, each containing the target source code, wherein the parsed target source code includes at least some of the source code that defines the search results on the webpage;processing the parsed target source code from each of the plurality of proxy computers located throughout a geographical region with the processor of the content optimization server, by causing the processor of the content optimization server to generate a relative metric as a measure of the online exposure of the target source code for each of the plurality of proxy computers located throughout the geographic region by causing the processor of the content optimization server to determine the location of target content on the webpage by determining the distance of the target content from a predetermined location on the webpage;determining an overall relative metric as a measure of the online exposure of the target source code in search results with the processor of the content optimization server by averaging the relative metric from each of the plurality of proxy computers using the processor of the content optimization server to determine an overall relative metric as a measurement of the online exposure of the target source code in search results;using the processor of the content optimization server to dynamically update the relative metric according to a selected schedule; andstoring the relative metric in a database.
  • 4. The method of claim 1, wherein causing the processor of the content optimization server to determine a relative metric for each parsed block of target source code from each of the plurality of proxy computers also comprises: determining whether the target content is visible to the user when first seeing the search results page.
  • 5. The method of claim 4, wherein causing the processor of the content optimization server to determine a relative metric for each parsed block of target source code from each of the plurality of proxy computers also comprises: determining whether the target content is visible to the user when first seeing the search results page; anddetermining the size of the visible target content relative to the size of the initially visible area of the search results page.
  • 6. The method of claim 1 wherein the relative metric is based on at least the location of the target content on the search results page.
  • 7. The method of claim 6 wherein the relative metric is further based on the size of the target content with respect to the size of the search results page, whether the target content is visible to the user when first seeing the search results page, and the size of the target content visible to the user relative to the size of the initially visible part of the search results page.
  • 8. The method of claim 1 also comprising: automatically generating a bid amount for the target content to be displayed on the search results page according to the relative metric;automatically changing the bid amount based on the dynamic updating of the relative metric; andrecommending a change in expenditure for the target content based on the bid amount.
  • 9. The method of claim 8, further comprising adjusting an advertising expenditure for online advertising based on the relative metric.
  • 10. The method of claim 1, further comprising: fetching a keyword from a database;forming a search query using the keyword on a search request webpage generated by a search engine server; andcausing the search engine server to perform a search using the keyword;wherein the search results page contains the search results for the keyword.
  • 11. The system of claim 2, wherein computer-readable instructions stored in the memory cause the processor to determine the location of the target content on the search results page by using HTML tags specifying where target content starts and ends on the search results page and determining the distance of the target content from a predetermined location on the search results page.
  • 12. The system of claim 11, wherein the computer-readable instructions stored in the memory cause the processor to further: determine whether the target content is visible to the user when first seeing the search results page; anddetermine the size of the visible target content relative to the size of the initially visible area of the search results page.
  • 13. The system of claim 2 wherein the relative metric is based on at least the location of the target content on the search results page.
  • 14. The system of claim 13 wherein the relative metric is further based on whether the target content is visible to the user when first seeing the search results page, and the size of the target content visible to the user relative to the size of the initially visible part of the search results page.
  • 15. The system of claim 2 wherein the computer-readable instructions stored in the memory additionally cause the processor to: automatically generate a bid amount for the target content to be displayed on the search results page according to the relative metric;automatically change the bid amount based on the dynamic updating of the relative metric; andrecommend a change in expenditure for the target content based on the bid amount.
  • 16. The method of claim 3, wherein causing the processor of the content optimization server to determine a relative metric for each parsed block of target source code from each of the plurality of proxy computers also comprises: determining whether the target content is visible to the user when first seeing the webpage.
  • 17. The method of claim 16, wherein causing the processor of the content optimization server to determine a relative metric for each parsed block of target source code from each of the plurality of proxy computers also comprises: determining whether the target content is visible to the user when first seeing the webpage on each of a plurality of proxy computers located throughout a geographic region; anddetermining the size of the visible target content relative to the size of the initially visible area of the webpage on each of the plurality of proxy computers located throughout the geographic region.
  • 18. The method of claim 3 wherein the relative metric is based on at least the distance of the target content from a given point on the webpage.
  • 19. The method of claim 18 wherein the relative metric is further based on whether the target content is visible to a user of each of a plurality of proxy computers located throughout a geographic region when first seeing the webpage, and the size of the target content visible to a user of each of a plurality of proxy computers located throughout a geographic region relative to the size of the initially visible part of the webpage.
  • 20. The method of claim 3 also comprising: automatically generating a bid amount for the target content to be displayed on the webpage according to the relative metric;automatically changing the bid amount based on the dynamic updating of the relative metric; andrecommending a change in expenditure for the target content based on the bid amount.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 17/129,492, filed Dec. 21, 2020, which is a continuation of U.S. application Ser. No. 14/099,795, filed Dec. 6, 2013, now U.S. Pat. No. 10,872,350, all of which are hereby incorporated by reference herein in their entireties, including but not limited to those portions that specifically appear hereinafter, the incorporation by reference being made with the following exception: In the event that any portion of the above-referenced applications are inconsistent with this application, this application supersedes said above-referenced applications.

US Referenced Citations (676)
Number Name Date Kind
3573747 Adams et al. Apr 1971 A
3581072 Nymeyer May 1971 A
4412287 Braddock, III Oct 1983 A
4674044 Kalmus et al. Jun 1987 A
4677552 Sibley, Jr. Jun 1987 A
4789928 Fujisaki Dec 1988 A
4799156 Shavit et al. Jan 1989 A
4808987 Takeda et al. Feb 1989 A
4823265 Nelson Apr 1989 A
4854516 Yamada Aug 1989 A
4903201 Wagner Feb 1990 A
RE33316 Katsuta et al. Aug 1990 E
5027110 Chang et al. Jun 1991 A
5053956 Donald et al. Oct 1991 A
5063507 Lindsey et al. Nov 1991 A
5077665 Silverman et al. Dec 1991 A
5101353 Lupien et al. Mar 1992 A
5136501 Silverman et al. Aug 1992 A
5168446 Wiseman Dec 1992 A
5205200 Wright Apr 1993 A
5243515 Lee Sep 1993 A
5258908 Hartheimer et al. Nov 1993 A
5280422 Moe et al. Jan 1994 A
5297031 Gutterman et al. Mar 1994 A
5297032 Trojan et al. Mar 1994 A
5301350 Rogan et al. Apr 1994 A
5305200 Hartheimer et al. Apr 1994 A
5325297 Bird et al. Jun 1994 A
5329589 Fraser et al. Jul 1994 A
5347632 Filepp et al. Sep 1994 A
5375055 Togher et al. Dec 1994 A
5377354 Scannell et al. Dec 1994 A
5394324 Clearwater Feb 1995 A
5407433 Loomas Apr 1995 A
5411483 Loomas et al. May 1995 A
5426281 Abecassis Jun 1995 A
5485510 Colbert Jan 1996 A
5493677 Balogh et al. Feb 1996 A
5553145 Micali Sep 1996 A
5557728 Garrett et al. Sep 1996 A
5579471 Barber et al. Nov 1996 A
5596994 Bro Jan 1997 A
5598557 Doner et al. Jan 1997 A
5621790 Grossman et al. Apr 1997 A
5640569 Miller et al. Jun 1997 A
5657389 Houvener Aug 1997 A
5664111 Nahan et al. Sep 1997 A
5664115 Fraser Sep 1997 A
5689652 Lupien et al. Nov 1997 A
5694546 Reisman Dec 1997 A
5706457 Dwyer et al. Jan 1998 A
5710889 Clark et al. Jan 1998 A
5715314 Payne et al. Feb 1998 A
5715402 Popolo Feb 1998 A
5717989 Tozzoli et al. Feb 1998 A
5721908 Lagarde et al. Feb 1998 A
5722418 Bro Mar 1998 A
5727165 Ordish et al. Mar 1998 A
5737599 Rowe et al. Apr 1998 A
5760917 Sheridan Jun 1998 A
5761496 Hattori Jun 1998 A
5761655 Hoffman Jun 1998 A
5761662 Dasan Jun 1998 A
5771291 Newton et al. Jun 1998 A
5771380 Tanaka et al. Jun 1998 A
5778367 Wesinger, Jr. et al. Jul 1998 A
5790790 Smith et al. Aug 1998 A
5794216 Brown Aug 1998 A
5794219 Brown Aug 1998 A
5796395 de Hond Aug 1998 A
5799285 Klingman Aug 1998 A
5803500 Mossberg Sep 1998 A
5818914 Fujisaki Oct 1998 A
5826244 Huberman Oct 1998 A
5835896 Fisher et al. Nov 1998 A
5845265 Woolston Dec 1998 A
5845266 Lupien et al. Dec 1998 A
5850442 Muftic Dec 1998 A
5870754 Dimitrova et al. Feb 1999 A
5872848 Romney et al. Feb 1999 A
5873069 Reuhl et al. Feb 1999 A
5873080 Coden et al. Feb 1999 A
5884056 Steele Mar 1999 A
5890138 Godin et al. Mar 1999 A
5890175 Wong et al. Mar 1999 A
5905975 Ausubel May 1999 A
5907547 Foladare et al. May 1999 A
5913215 Rubinstein et al. Jun 1999 A
5922074 Richard et al. Jul 1999 A
5924072 Havens Jul 1999 A
5926794 Fethe Jul 1999 A
5948040 DeLorme et al. Sep 1999 A
5948061 Merriman et al. Sep 1999 A
5956640 Eaton et al. Sep 1999 A
5970490 Morgenstern Oct 1999 A
5974396 Anderson et al. Oct 1999 A
5974412 Hazlehurst et al. Oct 1999 A
5986662 Argiro et al. Nov 1999 A
5987446 Corey et al. Nov 1999 A
5991739 Cupps et al. Nov 1999 A
5999915 Nahan et al. Dec 1999 A
6012053 Pant et al. Jan 2000 A
6029141 Bezos et al. Feb 2000 A
6035288 Solomon Mar 2000 A
6035402 Vaeth et al. Mar 2000 A
6044363 Mori et al. Mar 2000 A
6045447 Yoshizawa et al. Apr 2000 A
6047264 Fisher et al. Apr 2000 A
6049797 Guha et al. Apr 2000 A
6055518 Franklin et al. Apr 2000 A
6058379 Odom et al. May 2000 A
6058417 Hess et al. May 2000 A
6058428 Wang et al. May 2000 A
6061448 Smith et al. May 2000 A
6065041 Lum et al. May 2000 A
6070125 Murphy et al. May 2000 A
6073117 Oyanagi et al. Jun 2000 A
6078914 Redfern Jun 2000 A
6085176 Woolston Jul 2000 A
6104815 Alcorn et al. Aug 2000 A
6119137 Smith et al. Sep 2000 A
6128649 Smith et al. Oct 2000 A
6141010 Hoyle Oct 2000 A
6167382 Sparks et al. Dec 2000 A
6178408 Copple et al. Jan 2001 B1
6185558 Bowman et al. Feb 2001 B1
6192407 Smith et al. Feb 2001 B1
6199077 Inala et al. Mar 2001 B1
6202051 Woolston Mar 2001 B1
6202061 Khosla et al. Mar 2001 B1
6226412 Schwab May 2001 B1
6243691 Fisher et al. Jun 2001 B1
6269238 Iggulden Jul 2001 B1
6271840 Finseth et al. Aug 2001 B1
6275820 Navin-Chandra et al. Aug 2001 B1
6275829 Angiulo et al. Aug 2001 B1
6356879 Aggarwal et al. Mar 2002 B2
6356905 Gershman et al. Mar 2002 B1
6356908 Brown et al. Mar 2002 B1
6366899 Kernz Apr 2002 B1
6370527 Singhal Apr 2002 B1
6373933 Sarkki et al. Apr 2002 B1
6374260 Hoffert et al. Apr 2002 B1
6381510 Amidhozour et al. Apr 2002 B1
6415270 Rackson et al. Jul 2002 B1
6415320 Hess et al. Jul 2002 B1
6434556 Levin et al. Aug 2002 B1
6452609 Katinsky et al. Sep 2002 B1
6456307 Bates et al. Sep 2002 B1
6460020 Pool et al. Oct 2002 B1
6466917 Goyal et al. Oct 2002 B1
6484149 Jammes et al. Nov 2002 B1
6489968 Ortega et al. Dec 2002 B1
6522955 Colborn Feb 2003 B1
6523037 Monahan et al. Feb 2003 B1
6601061 Holt et al. Jul 2003 B1
6604107 Wang Aug 2003 B1
6625764 Dawson Sep 2003 B1
6643696 Davis et al. Nov 2003 B2
6661431 Stuart et al. Dec 2003 B1
6665838 Brown et al. Dec 2003 B1
6675178 Chinchar et al. Jan 2004 B1
6694436 Audebert Feb 2004 B1
6701310 Sugiura et al. Mar 2004 B1
6718536 Dupaquis Apr 2004 B2
6725268 Jackel et al. Apr 2004 B1
6728704 Mao et al. Apr 2004 B2
6732161 Hess et al. May 2004 B1
6732162 Wood et al. May 2004 B1
6785689 Daniel et al. Aug 2004 B1
6801909 Delgado et al. Oct 2004 B2
6856963 Hurwitz Feb 2005 B1
6889054 Himmel et al. May 2005 B2
6907401 Vittal et al. Jun 2005 B1
6912505 Linden et al. Jun 2005 B2
6925307 Mamdani et al. Aug 2005 B1
6978273 Bonneau et al. Dec 2005 B1
7043450 Velez et al. May 2006 B2
7069242 Sheth et al. Jun 2006 B1
7076453 Jammes et al. Jul 2006 B2
7076504 Handel et al. Jul 2006 B1
7080030 Eglen et al. Jul 2006 B2
7099891 Harris et al. Aug 2006 B2
7100111 McElfresh et al. Aug 2006 B2
7100195 Underwood Aug 2006 B1
7117207 Kerschberg et al. Oct 2006 B1
7127416 Tenorio Oct 2006 B1
7165091 Lunenfeld Jan 2007 B2
7167910 Farnham et al. Jan 2007 B2
7216115 Walters et al. May 2007 B1
7240016 Sturgis et al. Jul 2007 B1
7254547 Beck et al. Aug 2007 B1
7305614 Chen et al. Dec 2007 B2
7318037 Solari Jan 2008 B2
7324966 Scheer Jan 2008 B2
7340249 Moran et al. Mar 2008 B2
7349668 Ilan et al. Mar 2008 B2
7353188 Yim et al. Apr 2008 B2
7366755 Cuomo et al. Apr 2008 B1
7379890 Myr et al. May 2008 B2
7380217 Gvelesiani May 2008 B2
7383320 Silberstein et al. Jun 2008 B1
7401025 Lokitz Jul 2008 B1
7447646 Agarwal et al. Nov 2008 B1
7451476 Banks et al. Nov 2008 B1
7454464 Puthenkulam et al. Nov 2008 B2
7457730 Degnan Nov 2008 B2
7493521 Li et al. Feb 2009 B1
7496525 Mitchell Feb 2009 B1
7496527 Silverstein et al. Feb 2009 B2
7496582 Farnham et al. Feb 2009 B2
7516094 Perkowski Apr 2009 B2
7539696 Greener et al. May 2009 B1
7546625 Kamangar Jun 2009 B1
7552067 Nephew et al. Jun 2009 B2
7565615 Ebert Jul 2009 B2
7606743 Orzell et al. Oct 2009 B2
7610212 Klett et al. Oct 2009 B2
7653573 Hayes, Jr. et al. Jan 2010 B2
7676484 Fagin Mar 2010 B2
7834883 Adams Nov 2010 B2
7904348 Johnson et al. Mar 2011 B2
7904349 Hart et al. Mar 2011 B1
7912748 Rosenberg et al. Mar 2011 B1
7921031 Crysel et al. Apr 2011 B2
7933818 Kumar et al. Apr 2011 B1
7941751 Ebert May 2011 B2
7979340 MacDonald Korth et al. Jul 2011 B2
7983950 De Vita Jul 2011 B2
7983963 Byrne et al. Jul 2011 B2
7991800 Lawrence et al. Aug 2011 B2
8086643 Tenorio Dec 2011 B1
8095523 Brave et al. Jan 2012 B2
8112303 Eglen et al. Feb 2012 B2
8140989 Cohen et al. Mar 2012 B2
8166155 Rachmeler et al. Apr 2012 B1
8204799 Murray et al. Jun 2012 B1
8214264 Kasavin et al. Jul 2012 B2
8214804 Robertson Jul 2012 B2
8260852 Cselle Sep 2012 B1
8265991 Leffert Sep 2012 B1
8312056 Peng et al. Nov 2012 B1
8326662 Byrne et al. Dec 2012 B1
8359245 Ballaro et al. Jan 2013 B1
8370269 MacDonald-Korth et al. Feb 2013 B2
8370435 Bonefas et al. Feb 2013 B1
8386493 Muni et al. Feb 2013 B2
8392356 Stoner et al. Mar 2013 B2
8452691 MacDonald Korth et al. May 2013 B2
8473316 Panzitta et al. Jun 2013 B1
8494912 Fraser et al. Jul 2013 B2
8498906 Zmolek Jul 2013 B2
8545265 Sakamoto et al. Oct 2013 B2
8566170 Joseph et al. Oct 2013 B1
8577740 Murray et al. Nov 2013 B1
8583480 Byrne Nov 2013 B2
8584149 Crucs Nov 2013 B2
8630960 Gross Jan 2014 B2
8676632 Watson et al. Mar 2014 B1
8693494 Fiatal Apr 2014 B2
8719075 MacDonald Korth et al. May 2014 B2
8793650 Hilerio et al. Jul 2014 B2
8817033 Hur et al. Aug 2014 B2
9047341 Pan Jun 2015 B2
9047642 Byrne et al. Jun 2015 B2
9123069 Haynes et al. Sep 2015 B1
9201558 Dingman et al. Dec 2015 B1
9292361 Chitilian et al. Mar 2016 B1
9418365 Groarke et al. Aug 2016 B2
9430114 Dingman et al. Aug 2016 B1
9448692 Mierau et al. Sep 2016 B1
9483788 Martin Nov 2016 B2
9489681 Barous Nov 2016 B2
9727891 Mezzacca Aug 2017 B2
9741080 Byrne Aug 2017 B1
9747622 Johnson et al. Aug 2017 B1
9805425 MacDonald-Korth et al. Oct 2017 B2
9928752 Byrne et al. Mar 2018 B2
9940659 Behbahani et al. Apr 2018 B1
9954879 Sadaghiani et al. Apr 2018 B1
10013500 McClintock et al. Jul 2018 B1
10074118 Johnson et al. Sep 2018 B1
10102287 Martin Oct 2018 B2
10210518 Alnajem Feb 2019 B2
10217147 Shivaswamy et al. Feb 2019 B2
10269081 Byrne Apr 2019 B1
10423997 MacDonald Korth et al. Sep 2019 B2
10534845 Noursalehi et al. Jan 2020 B2
10769219 Martin Sep 2020 B1
10810654 Robertson et al. Oct 2020 B1
10853891 MacDonald-Korth et al. Dec 2020 B2
10872350 Hu et al. Dec 2020 B1
10896451 Johnson et al. Jan 2021 B1
10929890 Knab et al. Feb 2021 B2
10949876 Johnson et al. Mar 2021 B2
10970463 Noursalehi et al. Apr 2021 B2
10970742 Knijnik et al. Apr 2021 B1
10970769 Iqbal Apr 2021 B2
10977654 Kumar et al. Apr 2021 B2
11023947 Bosley et al. Jun 2021 B1
11061977 Raskar Jul 2021 B1
11062316 Bizarro et al. Jul 2021 B2
11176598 D'Souza et al. Nov 2021 B2
11205179 Patel et al. Dec 2021 B1
11315145 Knijnik et al. Apr 2022 B1
11463578 De Sanctis et al. Oct 2022 B1
11475484 Knab et al. Oct 2022 B1
11514493 Cook et al. Nov 2022 B1
11526653 Noursalehi et al. Dec 2022 B1
11593811 Hanis et al. Feb 2023 B2
11631124 Robertson et al. Apr 2023 B1
11676192 Moore et al. Jun 2023 B1
11694228 Hu et al. Jul 2023 B1
11734368 Campbell et al. Aug 2023 B1
20010002471 Ooish May 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010034667 Petersen Oct 2001 A1
20010034668 Whitworth Oct 2001 A1
20010044751 Pugliese, III et al. Nov 2001 A1
20010047290 Petras et al. Nov 2001 A1
20010047308 Kaminsky et al. Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20020002513 Chiasson Jan 2002 A1
20020007321 Burton Jan 2002 A1
20020007356 Rice et al. Jan 2002 A1
20020013721 Dabbiere et al. Jan 2002 A1
20020019763 Linden et al. Feb 2002 A1
20020022995 Miller et al. Feb 2002 A1
20020023059 Bari et al. Feb 2002 A1
20020026390 Ulenas et al. Feb 2002 A1
20020029187 Meehan et al. Mar 2002 A1
20020038312 Donner et al. Mar 2002 A1
20020040352 McCormick Apr 2002 A1
20020042738 Srinivasan et al. Apr 2002 A1
20020049622 Lettich et al. Apr 2002 A1
20020056044 Andersson May 2002 A1
20020065774 Young et al. May 2002 A1
20020082932 Chinnappan et al. Jun 2002 A1
20020099578 Eicher, Jr. et al. Jul 2002 A1
20020099579 Stowell et al. Jul 2002 A1
20020099602 Moskowitz et al. Jul 2002 A1
20020107718 Morrill et al. Aug 2002 A1
20020107853 Hofmann et al. Aug 2002 A1
20020111826 Potter et al. Aug 2002 A1
20020120537 Morea et al. Aug 2002 A1
20020120609 Lang et al. Aug 2002 A1
20020123957 Notarius et al. Sep 2002 A1
20020124100 Adams Sep 2002 A1
20020129282 Hopkins Sep 2002 A1
20020133502 Rosenthal et al. Sep 2002 A1
20020138399 Hayes et al. Sep 2002 A1
20020147625 Kolke, Jr. Oct 2002 A1
20020156802 Takayama et al. Oct 2002 A1
20020161648 Mason et al. Oct 2002 A1
20020161664 Shaya et al. Oct 2002 A1
20020188777 Kraft et al. Dec 2002 A1
20020194049 Boyd Dec 2002 A1
20020194357 Harris et al. Dec 2002 A1
20020198784 Shaak et al. Dec 2002 A1
20020198882 Linden et al. Dec 2002 A1
20030004855 Dutta et al. Jan 2003 A1
20030005046 Kavanagh et al. Jan 2003 A1
20030007464 Balani Jan 2003 A1
20030009362 Cifani et al. Jan 2003 A1
20030009392 Perkowski Jan 2003 A1
20030014400 Siegel Jan 2003 A1
20030028451 Ananian Feb 2003 A1
20030028605 Millett et al. Feb 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030035138 Schilling Feb 2003 A1
20030036914 Fitzpatrick et al. Feb 2003 A1
20030040970 Miller Feb 2003 A1
20030041008 Grey et al. Feb 2003 A1
20030046149 Wong Mar 2003 A1
20030069740 Zeidman Apr 2003 A1
20030069790 Kane Apr 2003 A1
20030069825 Hoffman et al. Apr 2003 A1
20030083961 Bezos et al. May 2003 A1
20030088467 Culver May 2003 A1
20030088511 Karboulonis et al. May 2003 A1
20030093331 Childs et al. May 2003 A1
20030097352 Gutta et al. May 2003 A1
20030105682 Dicker et al. Jun 2003 A1
20030110100 Wirth, Jr. Jun 2003 A1
20030119492 Timmins et al. Jun 2003 A1
20030131095 Kumhyr et al. Jul 2003 A1
20030139969 Scroggie et al. Jul 2003 A1
20030140007 Kramer et al. Jul 2003 A1
20030140121 Adams Jul 2003 A1
20030158792 Perkowski Aug 2003 A1
20030163340 Fitzpatrick et al. Aug 2003 A1
20030167213 Jammes et al. Sep 2003 A1
20030167222 Mehrotra et al. Sep 2003 A1
20030177103 Ivanov et al. Sep 2003 A1
20030187745 Hobday et al. Oct 2003 A1
20030200156 Roseman et al. Oct 2003 A1
20030204449 Kotas et al. Oct 2003 A1
20030217002 Enborg Nov 2003 A1
20030220835 Barnes, Jr. Nov 2003 A1
20040006509 Mannik et al. Jan 2004 A1
20040015416 Foster et al. Jan 2004 A1
20040029567 Timmins et al. Feb 2004 A1
20040041836 Zaner et al. Mar 2004 A1
20040044563 Stein Mar 2004 A1
20040055017 Delpuch et al. Mar 2004 A1
20040058710 Timmins et al. Mar 2004 A1
20040068697 Harik et al. Apr 2004 A1
20040073476 Donahue et al. Apr 2004 A1
20040078388 Melman Apr 2004 A1
20040093311 Chew et al. May 2004 A1
20040107136 Nemirofsky et al. Jun 2004 A1
20040117242 Conrad et al. Jun 2004 A1
20040122083 Pettit et al. Jun 2004 A1
20040122681 Ruvolo et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040122855 Ruvolo et al. Jun 2004 A1
20040128183 Challey et al. Jul 2004 A1
20040128283 Wang et al. Jul 2004 A1
20040128320 Grove et al. Jul 2004 A1
20040143731 Audebert et al. Jul 2004 A1
20040148232 Fushimi et al. Jul 2004 A1
20040172323 Stamm Sep 2004 A1
20040172379 Mott et al. Sep 2004 A1
20040174979 Hutton et al. Sep 2004 A1
20040186766 Fellenstein et al. Sep 2004 A1
20040199496 Liu et al. Oct 2004 A1
20040199905 Fagin et al. Oct 2004 A1
20040204989 Dicker et al. Oct 2004 A1
20040204991 Monahan et al. Oct 2004 A1
20040230989 Macey et al. Nov 2004 A1
20040240642 Crandell et al. Dec 2004 A1
20040249727 Cook Jr. et al. Dec 2004 A1
20040267717 Slackman Dec 2004 A1
20050010925 Khawand et al. Jan 2005 A1
20050021666 Dinnage et al. Jan 2005 A1
20050038733 Foster et al. Feb 2005 A1
20050044254 Smith Feb 2005 A1
20050055306 Miller et al. Mar 2005 A1
20050060664 Rogers Mar 2005 A1
20050097204 Horowitz et al. May 2005 A1
20050114229 Ackley et al. May 2005 A1
20050120311 Thrall Jun 2005 A1
20050131837 Sanctis et al. Jun 2005 A1
20050144064 Calabria et al. Jun 2005 A1
20050144074 Fredregill et al. Jun 2005 A1
20050193333 Ebert Sep 2005 A1
20050197846 Pezaris et al. Sep 2005 A1
20050197950 Moya et al. Sep 2005 A1
20050198031 Pezaris et al. Sep 2005 A1
20050202390 Allen et al. Sep 2005 A1
20050203888 Woosley et al. Sep 2005 A1
20050216300 Appelman et al. Sep 2005 A1
20050240474 Li Oct 2005 A1
20050262067 Lee et al. Nov 2005 A1
20050273378 MacDonald-Korth et al. Dec 2005 A1
20050278231 Teeter Dec 2005 A1
20060009994 Hogg et al. Jan 2006 A1
20060010105 Sarukkai et al. Jan 2006 A1
20060015498 Sarmiento et al. Jan 2006 A1
20060031240 Eyal et al. Feb 2006 A1
20060041638 Whittaker et al. Feb 2006 A1
20060048093 Jain et al. Mar 2006 A1
20060058048 Kapoor et al. Mar 2006 A1
20060069623 MacDonald Korth et al. Mar 2006 A1
20060085251 Greene Apr 2006 A1
20060173817 Chowdhury et al. Aug 2006 A1
20060206386 Walker et al. Sep 2006 A1
20060206479 Mason Sep 2006 A1
20060212358 Walker et al. Sep 2006 A1
20060218049 Walker et al. Sep 2006 A1
20060224470 Garcia Ruano et al. Oct 2006 A1
20060230035 Bailey et al. Oct 2006 A1
20060235752 Kavanagh et al. Oct 2006 A1
20060253476 Roth et al. Nov 2006 A1
20060259360 Flinn et al. Nov 2006 A1
20060271671 Hansen Nov 2006 A1
20060282304 Bedard et al. Dec 2006 A1
20070005424 Arauz Jan 2007 A1
20070027760 Collins et al. Feb 2007 A1
20070027814 Tuoriniemi Feb 2007 A1
20070055568 Osborne Mar 2007 A1
20070073641 Perry et al. Mar 2007 A1
20070077025 Mino Apr 2007 A1
20070078726 MacDonald Korth et al. Apr 2007 A1
20070078849 Slothouber Apr 2007 A1
20070083437 Hamor Apr 2007 A1
20070094597 Rostom Apr 2007 A1
20070100803 Cava May 2007 A1
20070130090 Staib et al. Jun 2007 A1
20070160345 Sakai et al. Jul 2007 A1
20070162379 Skinner Jul 2007 A1
20070174108 Monster Jul 2007 A1
20070192168 Van Luchene Aug 2007 A1
20070192181 Asdourian Aug 2007 A1
20070206606 Coleman et al. Sep 2007 A1
20070214048 Chan et al. Sep 2007 A1
20070226679 Jayamohan et al. Sep 2007 A1
20070233565 Herzog et al. Oct 2007 A1
20070239534 Liu et al. Oct 2007 A1
20070245013 Saraswathy et al. Oct 2007 A1
20070260520 Jha et al. Nov 2007 A1
20070282666 Afeyan et al. Dec 2007 A1
20070288298 Gutierrez et al. Dec 2007 A1
20070299743 Staib et al. Dec 2007 A1
20080010678 Burdette et al. Jan 2008 A1
20080015938 Haddad et al. Jan 2008 A1
20080021763 Merchant Jan 2008 A1
20080052152 Yufik Feb 2008 A1
20080071640 Nguyen Mar 2008 A1
20080082394 Floyd et al. Apr 2008 A1
20080103893 Nagarajan et al. May 2008 A1
20080120342 Reed et al. May 2008 A1
20080126205 Evans et al. May 2008 A1
20080126476 Nicholas et al. May 2008 A1
20080133305 Yates et al. Jun 2008 A1
20080133349 Nazer et al. Jun 2008 A1
20080140765 Kelaita et al. Jun 2008 A1
20080162574 Gilbert Jul 2008 A1
20080195476 Marchese et al. Aug 2008 A1
20080201218 Broder et al. Aug 2008 A1
20080215456 West et al. Sep 2008 A1
20080281714 Kluth Nov 2008 A1
20080288338 Wiseman et al. Nov 2008 A1
20080294536 Taylor et al. Nov 2008 A1
20080300909 Rikhtverchik et al. Dec 2008 A1
20080301009 Plaster et al. Dec 2008 A1
20080305869 Konforty et al. Dec 2008 A1
20080313010 Jepson et al. Dec 2008 A1
20080320012 Loving et al. Dec 2008 A1
20090006190 Lucash et al. Jan 2009 A1
20090006315 Mukherjea et al. Jan 2009 A1
20090030755 Altberg et al. Jan 2009 A1
20090030775 Vieri Jan 2009 A1
20090037355 Brave et al. Feb 2009 A1
20090106080 Carrier et al. Apr 2009 A1
20090106127 Purdy et al. Apr 2009 A1
20090110181 Koenig et al. Apr 2009 A1
20090119167 Kendall et al. May 2009 A1
20090157537 Miller Jun 2009 A1
20090164323 Byrne Jun 2009 A1
20090164442 Shani et al. Jun 2009 A1
20090182589 Kendall et al. Jul 2009 A1
20090204848 Kube et al. Aug 2009 A1
20090222337 Sergiades Sep 2009 A1
20090222348 Ransom et al. Sep 2009 A1
20090222737 Liesche et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234722 Evevsky Sep 2009 A1
20090240582 Sheldon-Neal et al. Sep 2009 A1
20090276284 Yost Nov 2009 A1
20090276305 Clopp Nov 2009 A1
20090292677 Kim Nov 2009 A1
20090293019 Raffel et al. Nov 2009 A1
20090313173 Singh et al. Dec 2009 A1
20100042684 Broms et al. Feb 2010 A1
20100070448 Omoigui Mar 2010 A1
20100076816 Phillips Mar 2010 A1
20100076851 Jewell, Jr. Mar 2010 A1
20100094673 Lobo et al. Apr 2010 A1
20100107123 Sareen et al. Apr 2010 A1
20100145831 Esfandiari et al. Jun 2010 A1
20100146413 Yu Jun 2010 A1
20100174754 B'Far et al. Jul 2010 A1
20100228617 Ransom Sep 2010 A1
20100274821 Bernstein et al. Oct 2010 A1
20110010656 Mokotov Jan 2011 A1
20110035276 Ghosh et al. Feb 2011 A1
20110055054 Glasson Mar 2011 A1
20110060621 Weller et al. Mar 2011 A1
20110103699 Ke et al. May 2011 A1
20110131253 Peukert et al. Jun 2011 A1
20110137973 Wei et al. Jun 2011 A1
20110145226 Gollapudi et al. Jun 2011 A1
20110153383 Bhattacharjya et al. Jun 2011 A1
20110153663 Koren et al. Jun 2011 A1
20110173076 Eggleston et al. Jul 2011 A1
20110191319 Nei et al. Aug 2011 A1
20110196802 Ellis et al. Aug 2011 A1
20110225050 Varghese Sep 2011 A1
20110231226 Golden Sep 2011 A1
20110231383 Smyth et al. Sep 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110258212 Lu et al. Oct 2011 A1
20110271204 Jones et al. Nov 2011 A1
20110276513 Erhart et al. Nov 2011 A1
20110289068 Teevan et al. Nov 2011 A1
20120005187 Chavanne Jan 2012 A1
20120030067 Pothukuchi et al. Feb 2012 A1
20120084135 Nissan et al. Apr 2012 A1
20120089454 Chen Apr 2012 A1
20120123899 Wiesner May 2012 A1
20120158480 Sundaram Jun 2012 A1
20120158715 Maghoul et al. Jun 2012 A1
20120164619 Meer Jun 2012 A1
20120166299 Heinstein et al. Jun 2012 A1
20120203723 Huang et al. Aug 2012 A1
20120231424 Calman et al. Sep 2012 A1
20120233312 Ramakumar et al. Sep 2012 A1
20120239504 Curlander et al. Sep 2012 A1
20120253985 Maron et al. Oct 2012 A1
20120271702 MacLachlan et al. Oct 2012 A1
20120278388 Kleinbart et al. Nov 2012 A1
20120284336 Schmidt et al. Nov 2012 A1
20120296697 Kumar Nov 2012 A1
20120323674 Simmons et al. Dec 2012 A1
20120323725 Johnston et al. Dec 2012 A1
20130031470 Daly, Jr. et al. Jan 2013 A1
20130073392 Allen et al. Mar 2013 A1
20130080200 Connolly et al. Mar 2013 A1
20130080426 Chen et al. Mar 2013 A1
20130085893 Bhardwaj et al. Apr 2013 A1
20130144870 Gupta et al. Jun 2013 A1
20130145254 Masuko et al. Jun 2013 A1
20130151331 Avner et al. Jun 2013 A1
20130151388 Falkenbort et al. Jun 2013 A1
20130173408 Lindblom Jul 2013 A1
20130185164 Pottjegort Jul 2013 A1
20130191409 Zeng et al. Jul 2013 A1
20130246300 Fischer et al. Sep 2013 A1
20130254059 Teo Sep 2013 A1
20130268561 Christie et al. Oct 2013 A1
20140019298 Suchet et al. Jan 2014 A1
20140019313 Hu et al. Jan 2014 A1
20140019542 Rao et al. Jan 2014 A1
20140025509 Reisz et al. Jan 2014 A1
20140032544 Mathieu et al. Jan 2014 A1
20140095273 Tang et al. Apr 2014 A1
20140114680 Mills et al. Apr 2014 A1
20140114755 Mezzacca Apr 2014 A1
20140136290 Schiestl et al. May 2014 A1
20140149390 Chen et al. May 2014 A1
20140172652 Pobbathi et al. Jun 2014 A1
20140180758 Agarwal et al. Jun 2014 A1
20140200959 Sarb et al. Jul 2014 A1
20140259056 Grusd Sep 2014 A1
20140278880 Lemphers et al. Sep 2014 A1
20140279191 Agarwal et al. Sep 2014 A1
20140289005 Laing et al. Sep 2014 A1
20140310094 Shapira et al. Oct 2014 A1
20140330818 Raina et al. Nov 2014 A1
20140337090 Tavares Nov 2014 A1
20140372415 Fernandez-Ruiz Dec 2014 A1
20150019958 Ying et al. Jan 2015 A1
20150032507 Narasimhan et al. Jan 2015 A1
20150088695 Lorbiecki et al. Mar 2015 A1
20150088968 Wei et al. Mar 2015 A1
20150089524 Cremonesi et al. Mar 2015 A1
20150106181 Kluth Apr 2015 A1
20150142543 Lellouche May 2015 A1
20150142771 Bhagat et al. May 2015 A1
20150161084 Long Jun 2015 A1
20150286742 Zhang et al. Oct 2015 A1
20150287066 Wortley et al. Oct 2015 A1
20160071105 Groarke et al. Mar 2016 A1
20160098488 Battle et al. Apr 2016 A1
20170076324 Waldron Mar 2017 A1
20170228375 Yang et al. Aug 2017 A1
20170235788 Borisyuk et al. Aug 2017 A1
20170300911 Alnajem Oct 2017 A1
20170344622 Islam et al. Nov 2017 A1
20170358000 Jain et al. Dec 2017 A1
20180033064 Varley Feb 2018 A1
20180167412 Barrett et al. Jun 2018 A1
20190043106 Talmor et al. Feb 2019 A1
20190066111 Bizarro et al. Feb 2019 A1
20190130904 Homma et al. May 2019 A1
20190197550 Sharma Jun 2019 A1
20190295088 Jia et al. Sep 2019 A1
20190325868 Lecue et al. Oct 2019 A1
20200005310 Kumar et al. Jan 2020 A1
20200065357 Noursalehi et al. Feb 2020 A1
20200184540 D'Souza et al. Jun 2020 A1
20200218766 Yaseen et al. Jul 2020 A1
20200250675 Hanis et al. Aug 2020 A1
20200293587 Ayers et al. Sep 2020 A1
20200410552 Stohlman Dec 2020 A1
Foreign Referenced Citations (27)
Number Date Country
2253543 Mar 1997 CA
2347812 May 2000 CA
0636993 Apr 1999 EP
0807891 May 2000 EP
1241603 Sep 2002 EP
2397400 Jul 2004 GB
2424098 Sep 2006 GB
2001283083 Dec 2001 JP
2002318935 Oct 2002 JP
2007021920 Feb 2007 JP
2009505238 Feb 2009 JP
WO1997017663 May 1997 WO
WO1998032289 Jul 1998 WO
WO1998047082 Oct 1998 WO
WO1998049641 Nov 1998 WO
WO1999059283 Nov 1999 WO
WO2000025218 May 2000 WO
WO20000068851 Nov 2000 WO
WO2001009803 Feb 2001 WO
WO2001082135 Nov 2001 WO
WO2001097099 Dec 2001 WO
WO2002037234 May 2002 WO
WO2003094080 Nov 2003 WO
WO2007021920 Feb 2007 WO
WO2012093410 Jul 2012 WO
WO2015116038 Aug 2015 WO
WO2015176071 Nov 2015 WO
Non-Patent Literature Citations (125)
Entry
Vural Aksakalli. Optimizing direct response in Internet display advertising. Electronic Commerce Research and Applications, vol. 11, Issue 3, pp. 229-240. (Year: 2012).
Vural Aksakalli. Optimizing direct response in Internet display advertising. Electronic Commerce Research and Applications, vol. 11, Issue 3. (Year: 2012).
Teo, “Organizational Factors of Success in Using Edis: A Survey of Tradenet Participants,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Tjostheim et al., “A case study of an on-line auction for the World Wide Web,” printed from www.nr.no/gem/elcom/puplikasjoner/enter98e.html on Jun. 10, 1990, 10 pages.
Turban, “Auctions and Bidding on the Internet: An Assessment,” Electronic Markets—The International Journal, Dec. 1997, 5 pages, vol. 7, No. 4.
ubid.com, “How do I Updated my Address, Phone, Credit Card, Password, etc.?” printed from web.archive.org/web/20010208113903/www.ubid.com/help/topic13asp on Aug. 30, 2007.
ubid.com, “How do I track my shipment?” printed from web.archive.org/web/20010331032659/www.ubid.com/help/topic27.asp on Aug. 30, 2007.
ubid.com, “Can I track all of my bids from My Page?” printed from web.archive.org/web/20010208114049/www.ubid.com/help/topic14.asp on Aug. 30, 2007.
Van Heck et al., “Experiences with Electronic Auctions in the Dutch Flower Industry,” Electronic Markets—The International Journal, Dec. 1997, 6 pages, vol. 7, No. 4.
Verizon Wireless, “Verizon Wireless Customers Get It NowSM; Get Games, Get Pix, Get Ring Tones and Get Going in Full Color,” press release to PRnewswire, Sep. 23, 2002.
Warbelow et al., “Aucnet: Tv Auction Network System,” Harvard Business School 9-190-001, Jul. 19, 1989, Rev. Apr. 12, 1996, pp. 1-15.
Weber, “How Financial Markets are Going On-line,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Wireless Internet, “DailyShopper Selects 2Roam to Enable Mobile Customers to Retrieve Nearby Sales and Promotions Information,” Wireless Internet, Apr. 2001.
Wireless Week, “Verizon Wireless Gets Going on BREW Agenda,” Wireless Week, Sep. 23, 2002.
xchanger.net, webpage printed from www.auctiva.com/showcases/as_4sale.asp?uid=exchanger, undated but at least as early as Oct. 12, 2000.
Yu et al., “Distributed Reputation Management for Electronic Commerce,” Computational Intelligence, 2002, pp. 535-549, vol. 18, No. 4.
Zetmeir, Auction Incentive Marketing, print of all pages of website found at home.earthlink.net/˜bidpointz/ made Oct. 8, 2004.
Zimmermann, “Integration of Financial Services: The TeleCounter,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Zwass, “Electronic Commerce: Structures and Issues,” International Journal of Electronic Commerce, Fall 1996, pp. 3-23, vol. 1, No. 1.
Message Passing from Wikipedia, archived May 6, 2016, retrieved from https://en.wikipedia.org/wiki/message_passing, 4 pages.
Di et al., “A New Implementation for Ontology Mapping Based enterprise Semantic Interoperation,” by Xiaofeng Di and Yushun Fan, Applied Mechanics and Materials, vols. 16-19 (2009), pp. 644-648 (Year:2009).
Nicolle et a., “XML Integration and Toolkit for B2B Applications,” by Christophe Nicolle, Kokou Yetongnon, and Jean-Claude Simon, Journal of Database Management, Oct.-Dec. 2003 (Year: 2003).
V. Aksakalli, Optimizing direct response in Internet display advertising, Elsevier, vol. 11, Issue 3, May-Jun. 2012, pp. 229-240. (Year: 2012).
Gallagher et al. A framework for targeting banner advertising on the internet. IEEE, pp. 265-274 (Year: 1997).
Alex, Neil, “Optimizing Search Results in Elasticsearch with Scoring and Boosting”, Mar. 18, 2015, Qbox.io, accessed at [https://qbox.io/blog/optimizing-search-results-in-elasticsearch0with-scoring-and-boosting] (year: 2015).
Hybrid algorithms for recommending new items. Cremonesi et al., ResearchGate, Google, (year:2011).
Dubinsky, B., “Uncovering accounts payable fraud by using ‘fuzzy matching logic’: Part 1,” Business Credit 110.3:6 (4), National Association of Credit Management, Mar. 2008, (Year: 2008).
Dubinsky, B., “Uncovering accounts payable fraud by using ‘fuzzy matching logic’: Part 2,” Business Credit 110.4: 64 (3), National Association of Credit Management, Apr. 2008 (Year:2008).
Qureshi et al. “Taxonomy based Data Marts,” by Asiya Abdus Salam Qureshi and Syed Muhammad Khalid Jamal, International Journal of Computer Applications (0975-8887), vol. 60, No. 13, Dec. 2012 (Year: 2012).
Haibin Liu, Vlado Keselj, “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering, vol. 61, Issue 2, 2007, pp. 304-330 (Year: 2007).
Sumathi et al., “Automatic Recommendation of Web Pages in Web Usage Mining,” International Journal on Computer Science and Engineering, vol. 02, No. 09, 2010 (Year: 2010).
Harrington, Caitlin “The Future of Shopping” Wired 26. 12:30. Conde Nast Publications Inc. (Dec. 2018).
Craver, Thom, Inside Bing's Spell Checker, Jan. 4, 2013, searchenginewatch.com, accessed at [https://www.searchenginewatch.com/2013/01/04/inside-beings-spell-checker/] (Year: 2013).
Business Wire [New York] “Data Warehousing Leader Acta Inc. Extends Award-Winning Technology to E-Commerce” Sep. 14, 1999 (Year: 1999).
“A Collaborative Recommender Combining Item Rating Similarity and Item Attribute Similarity,” Gong et al., IEEE Computer Society 3pgs. (Year:2008).
2Roam, Inc., multiple archived pages of www.2roam.com retrieved via Internet Archive Wayback Machine on Jun. 10, 2008.
Alt et al., “Bibliography on Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 5 pages, vol. 3, No. 3.
Alt et al., “Computer Integrated Logistics,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 1, No. 3.
Anonymous, Image manipulation (image-editing software and image-manipulation systems)(Seybold Special Report, Part II), Seybold Report on Publishing Systems, May 15, 1995, pS35(9), vol. 24, No. 18.
auctionwatch.com, multiple pages—including search results for “expedition,” printed Apr. 21, 2011.
auctiva.com, multiple pages, undated but website copyright date is “1999-2000.”.
Ball et al., “Supply chain infrastructures: system integration and information sharing,” ACM SIGMOD Record, 2002, vol. 31, No. 1, pp. 61-66.
Berger et al., “Random Multiple-Access Communication and Group Testing,” IEEE, 1984.
Braganza, “IS Resarch at Cranfield—A Look at the Future,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Brecht et al., “The IM 2000 Research Programme,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Business Wire business/technology editors, “Sellers Flock to OutletZoo.com as New Automatic Price Drop Method Moves Excess Inventory Online,” Business Wire, Oct. 25, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Expands in Real Estate Market with Adoption of Rimfire on realtor.com,” Business Wire, Nov. 8, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Shows Strong Revenue Growth in Internet Imaging Business,” Business Wire, Nov. 10, 1999.
Business Wire business editors/high-tech writers, “2Roam Partners with Pumatech to Delivery Wireless Alerts,” Business Wire, Dec. 18, 2000.
Business Wire business editors/high-tech writers, “2Roam Takes eHow's How-to Solutions Wireless: With 2Roam, the Web's One-Stop Source for getting Things Done is on More Wireless Devices, with Ability to Purchase Its Products from Anywhere,” Business Wire, Oct. 2, 2000.
Business Wire business editors/high-tech writers, “2Roam Drives Hertz to the Wireless Web: Number One Car Rental Company to Provide Customers Wireless Access from Any Device,” Business Wire, Aug. 7, 2001.
buy.com, www.buy.com homepage, printed Oct. 13, 2004.
Chen et al., “Detecting Web Page Structure for Adaptive Viewing on Small Form Factor Devices,” ACM, May 20-24, 2003.
Chen, M. (2007). Knowledge assisted data management and retrieval in multimedia database systems (Order No. 3268643).
Y.K. Choi and S. K. Kim, “An auxillary reccomendation system for repetitively purchasing items in E-commerce,” 2014 International Conference on Big Data and Smart Computing (Bigcomp), Bangkok, 2014, pp. 96-98. (Year 2014).
Clarke, “Research Programme in Supra-organizational Systems,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Clemons et al., “Evaluating the prospects for alternative electronic securities markets,” Proceedings of the twelfth International conference on information systems, New York, New York, United States, pp. 53-64, 1991.
Fan, J., Keim, F.A., Gao, Y., Luo, H. and Li, Z. (2009). JustClick: Personalized Image Recommendation via Exploratory Search from Large-Scale Flickr Images. Feb. 2009. IEEE Transactions on Circuits and Systems for Video Technology, 19(2), pp. 2730288. (Year: 2009).
friendster.com, homepage and “more info” pages, printed Apr. 29, 2004.
Google News archive search for “2Roam marketing” performed over the date range 2000-2003.
Google News archive search for “2Roam SMS” performed over the date range 2000-2008.
Grabowski et al., “Mobile-enabled grid middleware and/or grid gateways,” GridLab—A Grid Application Toolkit and Testbed, Work Package 12—Access for Mobile Users, Jun. 3, 2003.
Graham, “The Emergence of Linked Fish Markets in Europe,” Electronic Markets—The International Journal, Jul. 1993, 4 pages, vol. 8, No. 2.
Gunthorpe et al., “Portfolio Composition and the Investment Horizon,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 51.
Halperin, “Toward a Process Handbook for Organizational Coordination Processes,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Hess et al., “Computerized Loan Origination Systems: An Industry Case Study of the Electronic Markets Hypothesis,” MIS Quarterly, Sep. 1994, pp. 251-275.
IBM, “Anyonymous Delivery of Goods in Electronic Commerce,” IBM Technical Disclosure Bulletin, Mar. 1996, pp. 363-366, vol. 39, No. 3.
IBM, “Personal Optimized Decision/Transaction Program,” IBM Technical Disclosure Bulletin, Jan. 1995, pp. 83-84, vol. 38, No. 1.
Icrossing, “Icrossing Search Synergy: Natural & Paid Search Symbiosis,” Mar. 2007.
IEEE 100—The Authoritative Dictionary of IEEE Standard Terms, Seventh Edition, 2000. Entire book cited; table of contents, source list, and terms beginning with A included. ISBN 0-7381-2601-2a.
Ives et al., “Editor's Comments—MISQ Central: Creating a New Intellectual Infrastructure,” MIS Quarterly, Sep. 1994, p. xxxv.
Joshi, “Information visibility and its effect on supply chain dynamics,” Ph.D. dissertation, Massachusetts Institute of Technology, 2000 (fig. 4.5; p. 45).
Klein, “Information Logistics,” Electronic Markets—The International Journal, Oct. 1993, pp. 11-12, vol. 3, No. 3.
Klein, “Introduction to Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, 4 pages, vol. 7, No. 4.
Kubicek, “The Organization Gap,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
S. Kulkarni, A. M. Sankpal, R.R. Mudholkar and Kirankumari, “Recommendation engine: Matching individual/group profiles for better shopping experience,” 2013 15th International Conference on Advanced Computing Technologies (ICACT), Rajampet, 2013, pp. 1-6. (Year: 2013).
Kuula, “Telematic Services in Finland,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lalonde, “The EDI World Institute: An International Approach,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lee et al., “Intelligent Electronic Trading for Commodity Exchanges,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Lee et al., “Electronic Brokerage and Electronic Auction: The Impact of IT on Market Structures,” Proceedings of the 29th Annual Hawaii International Conference on System Sciences, 1996, pp. 397-406.
Lee, “Aucnet: Electronic Intermediary for Used-Car Transactions,” Electronic Market—The International Journal, Dec. 1997, pp. 24-28, vol. 7, No. 4.
T.Y. Lee, S. Li and R. Wei, “Needs-Centric Searching and Ranking Based on Customer Reviews,” 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services, Washington, DC, 2008, pp. 128-135. (Year: 2008).
Levy, Michael, and Dhruv Grewal. “Supply chain management in a networked economy.” Journal Retailing 76.4 (2000): 415-429.
Live365 press release, “Live365 to Offer Opt-In Advertising on Its Website,” Oct. 15, 2004.
London Business School, “Overture and Google: Internet Pay-Per-Click (PPC) Advertising Options,” Mar. 2003.
M2 Presswire, “Palm, Inc.: Palm unveils new web browser optimised for handhelds; HTML browser offers high-speed web-browsing option,” Mar. 13, 2002.
Malone et al., “Electronic Markets and Electronic Hierarchies,” Communications of the ACM, Jun. 1987, pp. 484-497, vol. 30, No. 6.
Mansell et al., “Electronic Trading Networks: The Route to Competitive Advantage?” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Mardesich, “Onsale takes auction gavel electronic,” Computer Reseller News, Jul. 8, 1996, pp. 2, 32.
Marteau, “Shop with One Click, Anywhere, Anytime,” Information Management and Consulting, 2000, pp. 44-46, vol. 15, No. 4.
Massimb et al., “Electronic Trading, Market Structure and Liquidity,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 39-49.
McGinnity, “Build Your Weapon,” PC Magazine, Apr. 24, 2011, printed from www.pcmag.com/print_article2?0,1217,a%253D3955,00.asp.
Meade, “Visual 360: a performance appraisal system that's 'fun,” HR Magazine, 44, 7, 118(3), Jul. 1999.
“Mediappraise: Mediappraise Receives National Award for Web-Based Technology That Enables Companies to Solve Thorny HR Problem,” Dec. 14, 1998.
Medvinsky et al., “Electronic Currency for the Internet,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
metails.com, www.metails.com homepage, printed Oct. 13, 2004.
Microsoft Computer Dictionary, Fifth Edition, front matter and p. 33.
Microsoft Computer Dictionary, Fifth Edition, front matter, back matter, and pp. 479, 486.
Neches, “Fast—A Research Project in Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 4 pages, vol. 3., No. 3.
Neisser, “Which is better for Social Media Monitoring: TweetDeck or SproutSocial” Mar. 17, 2011, Social Media Examiner, https://www.socialmediaexaminer.com/which-is-better-for-social-media-monitoring-tweetdeck-or-sproutsocial/.
Neo, “The implementation of an electronic market for pig trading in Singapore,” Journal of Strategic Information Systems, Dec. 1992, pp. 278-288, vol. 1, No. 5.
O'Mahony, “An X.500-based Product Catalogue,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
“Onsale: Onsale Brings Thrill of Auctions and Bargain Hunting Online: Unique Internet retail services debuts with week-long charity auction for the Computer Museum in Boston,” May 24, 1995, printed from www.dialogweb.com/cgi/dwclient?dwcommand,DWEBPRINT%20810-489267.
“Onsale joins fray as online shopping pcks up speed: Internet Booms,” Comptuer Reseller News, Jun. 5, 1995.
Palm, Inc., PalmTM Web Pro Handbook, copyright 2002-2003.
Post et al., “Application of Auctions as a Pricing Mechanism for the Interchange of Electric Power,” IEEE Transactions of Power Systems, Aug. 1995, pp. 1580-1584, vol. 10, No. 3.
Preist et al., “Adaptive agents in a persistent shout double auction,” International Conference on Information and Computation, Proceedings of the first international conference on information and computation economies, Oct. 25-28, 1998, Charleston, United States, pp. 11-18.
Qualcomm, “Brew Developer Support,” printed from web.archive.org/web/20020209194207/http://www.qualcomm.com/brew/developer/support/kb/52.html on Aug. 30, 2007.
RCR Wireless News, “Lockheed Martin to use 2Roam's technology for wireless platform,” RCR Wireless News, Sep. 10, 2001.
Reck, “Formally Specifying an Automated Trade Execution System,” J. Systems Software, 1993, pp. 245-252, vol. 21.
Reck, “Trading-Process Characteristics of Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, pp. 17-23, vol. 7, No. 4.
repcheck.com, www.repcheck.com homepage, printed from web.archive.org/web/20020330183132/http://repcheck.com on Sep. 5, 2009.
Resnick et al., “Reputation Systems,” Communications of the ACM, Dec. 2000, pp. 45-48, vol. 43, No. 12.
Rockoff et al., “Design of an Internet-based system for remote Dutch auctions,” Internet Research: Electronic Networking Applications and Policy, 1995, pp. 10-16, vol. 5, No. 4.
Rodriguez, Camille, HootSuite vs. social Oomph vs. Tweekdeck, Jan. 4, 2012, http://polkadotimpressions.com/2012/01/04/hootsuite-vs-social-oopmphvs.tweetdeck/ (Year: 2012).
Rose, “Vendors strive to undo Adobe lock-hold,” Computer Reseller News, Feb. 5, 1996, n 669, p. 71(7).
Ross, David Frederick, Frederick S. Weston, and W. Stephen. Introduction to supply chain management technologies. CRC Press, 2010.
Rysavy, “Mobile-commerce ASPs do the legwork,” Network Computing, Jan. 22, 2001, p. 71, 6 pgs., vol. 12, No. 2.
Saunders, “AdFlight to Offer WAP Ads,” Oct. 17, 2000, printed from clickz.com/487531/print.
Schaffer, Neil, The Top 20 Twitter clients—HootSuite, TweetDeck and More, Jan. 31, 2012, https://maximizesocialbusinss.com/top-20-twitter-clients-2012-9175/ (Year: 2012).
Schmid, “Electronic Markets,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Schwankert, “Matsushita Taps 2Roam for Wireless Solutions,” www.internetnews.com/bus-news.article.bhp/674811, Feb. 2, 2001.
Sen, “Inventory and Pricing Models for Perishable Products,” Doctor of Philosophy Dissertation—University of Southern California, Aug. 2000.
Siegmann, “Nowhere to go but up,” PC Week, Oct. 23, 1995, 3 pages, vol. 12, No. 42.
Telephony Staff, “Air-ASP,” Telephony Online, Oct. 2, 2000, 3 pages.
Continuations (2)
Number Date Country
Parent 17129492 Dec 2020 US
Child 18202844 US
Parent 14099795 Dec 2013 US
Child 17129492 US