To increase sales, merchants and service providers use a variety of styles and channels for advertising to potential customers. The decision whether to spend the money on advertising is often not the major question. Rather, merchants need to decide how their advertising money will be most effective in reaching receptive and purchase prone segments of the population. It therefore makes sense that a merchant or other advertiser would want to spend their advertising dollars in the most effective manner possible. This means that they will need to target their advertising efforts at those consumers who are most likely to make a purchase in response to receiving or viewing an advertisement. This type of advertising is known as target marketing.
Traditional target marketing relies on consumer surveys and tracking spending patterns for online and brick-and-mortar sales on a merchant-by-merchant basis. Although such targeting can be somewhat helpful, there are major deficiencies in this type of target marketing. For example, the consumer surveys are often self-selecting in that only certain types of consumer are likely to respond to print, telephone or in-person consumer surveys. These types of consumers can fall into many categories, but tend to be self-sort based on the type of survey that is being conducted.
Print surveys, like the type included on a self-addressed postage-paid postcard along with a purchased product, require that a consumer take the time to fill-in the survey and then send it back. Such surveys automatically exclude busy, lazy and/or indifferent consumers and target only certain personality types that will take the time necessary to respond. Similarly, consumers are sometimes asked to visit a website printed on a paper or online/email receipt after completing a purchase to participate in a survey. Such tactics can have similar results in only capturing a small portion of potential consumers.
To improve the response rate of print or online consumer surveys, some merchants and advertiser have taken to offering incentives likes rebates, discounts and special offers to consumers who respond to the survey. However, these programs can skew consumer responses if the consumer thinks his or her response will have an impact on the size or amount of the promised incentive. Furthermore, incentive programs often result in capturing responses from only extremely cost sensitive consumers and exclude the most valuable type of consumers who are likely to pay full retail prices.
On the other end of the spectrum of consumer surveys are person-to-person surveys, such as telephone and in-person surveys, in which an interviewer asks a consumer to respond to a set of questions. These types of surveys are even more effective in polarizing consumers. Consumers who are likely to respond person-to-person surveys are a very small subset of all potential consumers. Most consumers simply do not have the time or interest to participate in person-to-person surveys and some are in fact very annoyed by such intrusions on their time. As such, most types of consumer surveys have significant limitations on how well they can provide information for targeted marketing based on the likelihood that only limited portions of the potential consumer population will respond, and do so accurately.
To get the best information as to the interests and propensity for spending, some online advertisers have taken to detecting key words and phrases in consumers' browser-based email activity and web browsing to determine what consumers in a particular areas determined by IP addresses might find appealing and likely to purchase. Although such techniques are more passive, in that consumers do not have to enter actively any information in addition to the information they are already entering to perform intended functions or complete other online tasks, the feedback loop on the effectiveness of such advertising is still rather limited.
Although key-word and IP address based advertising can track the click-through rate of consumers who are selectively chosen to be shown a particular advertisement, that information can really only be used to determine the effectiveness of the algorithms used to determine which consumers should be shown a particular advertisement and not the effectiveness of the advertisement in obtaining a sale or potential for a particular sale based on past or trending purchasing behavior on a population on the consumer level.
Some advertiser rely on the merchants themselves and other data mining operations to track spending and sale patterns of consumers on a merchant-by-merchant basis. While useful, such data is limited in a variety of ways. In scenarios in which spending patterns are determined by looking at a merchant's own customers' spending, that information is really only useful for incentivizing existing customers to spend more and not particularly helpful in finding new customers. Data mining of particular market segments looking for potential new customer information has similar limitations. Most merchants will want to protect their customers' information from being used by competitors to lure customers away. Because of the competitive nature of most markets, data reported by most merchants tends to be scrubbed of any useful information that could possibility be used to measure the effectiveness of a particular advertising campaign or promotional program in obtaining new customers.
Advertisers, publishers and merchants need new, accurate and cost-effective ways to target and track the effectiveness of print and online advertising. Embodiments of the present invention address this and other needs.
Embodiments of the present invention are directed towards systems and methods for providing transaction level data aggregates to advertisers, publishers and merchants regarding the spending patterns and behaviors of various groups identified or associated with a group characteristic. The group characteristic can be based on any number of data associated with user accounts. For example, one embodiment the present invention can determine transaction level data aggregates for accounts associated with a population of users who live in a specific zip code.
Other embodiments of the present invention are directed toward transaction aggregators and systems for deriving aggregated transaction level data having a server computer comprising (a) a processor; and (b) a computer readable medium coupled to the processor. The computer readable medium can include code for causing the processor to implement a method for deriving aggregated transaction level data by sending a transaction data inquiry file from an aggregator server to a transaction database and in return, receiving a transaction data response file from the transaction database. The transaction aggregator can then parse the transaction data response file according to the transaction level inquiry file and determine a first transaction level data aggregate from the parsed transaction data response file. The first transaction aggregate is based on a first group characteristic.
In yet other embodiments, the transaction aggregates can be based on group characteristics such as demographic information, address, zip code and consumer type. Furthermore, the transaction aggregates can be specified by group characteristics that are correlated to IP addresses.
Embodiments of the present invention are directed towards systems and methods for gathering and aggregating transaction level data regarding user accounts associated with specific group characteristics. Such embodiments can include a transaction aggregator within a computer network or a payment processing network to manage, process and deliver customized or standardized descriptive transaction level data aggregates to entities such as publishers, advertisers and merchants. The transaction level data aggregates can be used by the entities to plan, focus and measure the effectiveness of targeted advertising.
Method 100 begins at step 110 in which a publisher, an advertiser, merchant or other requesting entity can send an inquiry for transaction level data for a desired group characteristic. Such inquiries can be in the form of a transaction level aggregate request file. For example, a merchant, either a traditional brick-and-mortar or an online merchant, can request transaction level data, using a transaction level aggregate request file, for all credit card accounts with a home address listed in a specific zip code. The desired zip code could represent the zip or zip codes surrounding a particular store location. The requested transaction level data for the credit card accounts can be as general or specific as the merchant would like. For example, the merchant may ask for the total amount spent using credit card accounts having billing addresses in the zip codes surrounding the merchant's outlets for specific periods. The periods can reflect times before, during or after the launch of an advertisement or offer to consumers residing in the zip codes. Using such information, a requesting entity can specifically target the advertisement or offer and subsequently evaluate the effectiveness of the advertisement or offer. This of course, is but one example of the information about which a requesting entity can inquire. The scope, depth and detail of the transaction level data for one or more separate or overlapping group characteristics can vary according to the needs of the requesting entity.
In step 120, a transaction aggregator can receive a transaction data inquiry for a specific group characteristic. The transaction data inquiry can include a request for information concerning the identities of the user account holders associated with the specific group characteristic. In other embodiments, the transaction data inquiry can request that the transaction data be returned without, and thus hiding, the identities of the users associated with the user accounts having the specific group characteristic. A description of the transaction aggregator and various uses thereof can be found in U.S. patent application Ser. No. 12/616,048, filed on Dec. 18, 2009, and is herein incorporated by reference. In some embodiments, the transaction aggregator can receive the transaction data inquiry in a transaction data inquiry file over existing electronic communication media or networks, such as a payment-processing network used in processing credit card transactions and payments. The transaction aggregator can also receive the transaction data inquiry file via other data or financial networks such as the Internet or proprietary banking networks.
Once the transaction aggregator receives the transaction data inquiry file from the requesting entity at step 120, it can parse out the specifics of the transaction data inquiry and send a linkage request file to one or more data sources in step 130. The linkage request file can include a request for all user accounts associated with a specific group characteristic specified in the transaction data inquiry file. In some embodiments, the linkage request file can include a request for the identities of the users associated with user accounts associated with a specific group characteristic specified in the transaction data inquiry file. In other embodiments, the linkage request file can include a request to omit the identities of the users associated with user accounts associated with a specific group characteristic specified in the transaction data inquiry file. In this way, the transaction aggregator can chose to maintain the anonymity of individual users associated with the user accounts determined to have a specific group characteristic.
The linkage request file sent to the data sources can include a template inquiry file or format containing specific information parsed from the transaction data inquiry file received from the requesting entities. For example, a linkage request file can include an entry specifying a specific zip code or set of zip codes, an entry specifying the type of credit card accounts and an entry specifying a particular time period of interest. Such a linkage request file can specify credit accounts associated with zip code 94061, having a limit greater than $7000 and that have been used in the last 5 months. The linkage request file can be sent from the transaction aggregator in a format native to the transaction aggregator or in a format specified by the particular data source, i.e. a credit reporting bureau.
In response to the linkage request file, the transaction aggregator can receive an linkage response file from the data source linking all the accounts to one or more of the specific pieces of information included in the linkage request file in step 140. For example, the linkage response file can include a listing of all accounts having a billing address associated, with a specific zip code or range of addresses in a particular city or county. The linkage response file can include a listing of identifiers, such as a social security number or a name, linked to the accounts associated with the specified information.
In step 150, the transaction aggregator can use the linkage response file to request transaction level data from a transaction database for all or some the account numbers linked to or associated with the group characteristic. The request sent from the transaction aggregator can be in the form of a transaction data request file. In some embodiments, the scope, depth and details of the transaction level data can vary according to the transaction data inquiry file or the transaction data request file. For example, the transaction data request file can specify specific dates of transactions. The transaction data request file can also specify information including, but not limited to, the amount of the transactions, location of the transactions, merchant identifier or type, date of the transaction and any other transaction specific data stored by the transaction database, such as the identity of the users associated with each transaction. However, the identities of the users associated with each transaction can also be omitted to protect the privacy of and provide anonymity for the users.
In step 160, the transaction aggregator can receive transaction level data from the transaction database in a transaction data response file and parse and process the transaction response file into transaction level data aggregates according to the transaction data inquiry and other rules and protocols. The transaction data response file can include information regarding multiple accounts for multiple users associated with multiple group characteristics. The transaction data response file can include or omit the identities of the users associated with the accounts associated with the group characteristic. In some embodiments, the processing performed by the transaction aggregator can include vast amounts of data included in the transaction level data. As such, it can be desirable, in some embodiments, for the transaction aggregator to be able to distribute the processing among multiple processors, memories and data stores according to various distributed computing methods known in the art. For example, the processing of such vast quantities of data can be performed using various cloud-computing techniques offered by cloud-computing services.
Once the transaction aggregator has completed determining the transaction aggregates, also referred to as transaction level data aggregates, in step 160, it can send the transaction aggregates to the requesting entity, via one or more of the electronic communication media or networks mentioned above, in step 170. As used herein, the terms transaction level data aggregates and transaction aggregates can be used interchangeably to refer to any processed results using transaction level data and in response to a transaction data inquiry. The aggregates can be associated with one or more user identities associated with the user accounts included in some or all of the transaction level aggregates. As such, the transaction aggregator can be configured to either provide the identities of the users associated with data in the transaction aggregates for marketing purposes or other purposes. In other embodiments, the identities of the users associated with user accounts having transactions included in a particular transaction aggregate can be omitted to protect the privacy of the users. In some embodiments, use of existing communication media is desirable to facilitate cost effective and easy adoption of methods and systems according to various embodiments of the present invention.
Network 230 can be a credit card payment processing network. The network 230 can include transaction server 239. Transaction server 239 can include transaction database 235 and a transaction aggregator/inquiry processor 237. Transaction database 235 can include transaction level data such as detailed information regarding individual credit card transactions. In some embodiments, transaction database 235 can be a network of data stores that serves one or more credit card processing networks or associations. Aggregator/inquiry processor 237 can be one or more computers or server computers. Aggregator/inquiry processor 237 can communicate with transaction database 235 over one or more wired or wireless electronic communication media.
In some embodiments, network 230, transaction server 239 or aggregator/inquiry processor 237 can communicate with external or internal data source 240 over one or more electronic communication media suitable for transmitting data quickly and reliably. In some embodiments, the data source 240 can be a credit reporting bureau. Data source 240 can store and report on information regarding user accounts and any information associated with user accounts. For example, data source 240 can store information associated with a consumer credit card account such as home address including a zip code, Social Security number, classification of consumer, classification of user account, aging history and other information. The numbered arrows pictured in
In various embodiments, any of the foregoing described entities or components of system 200 can be configured to remove the identities of users associated with the transaction level data included in the transaction aggregates to protect the identities and privacy of the users. In other embodiments, any and all of the foregoing described entities or components of system 200 can be configured to include the identities of the users associated with the transaction level data included in the transaction aggregates for various marketing, tracking and other purposes.
Model transaction aggregates 330 can include any number of recommended or suggested model transaction aggregates that the aggregator 237 or network 230 has determined might be useful to one or more of the entities including, but not limited to, publisher 203, advertiser 205 or merchant 207. The model transaction aggregates 330 shown in
In some embodiments, the model transaction aggregates 330 can be customized for use by one of the entities. In such embodiments, the model transaction aggregates 330 can be used as templates in which the requesting entities can specify certain values, such as time-periods and threshold values, they might find useful for their own internal targeted marketing programs and analysis. In other embodiments, model transaction aggregates 330 can be fixed, in such scenarios, any participating entities would only have to simply choose from a menu of model transaction aggregates they might wish to receive. In other embodiments, the model transaction aggregates can be fixed except for one or more key group characteristics.
For example, as shown in model transaction aggregates 330 model transaction aggregate number 1 specifies an aggregate equaling the total dollar amount spent at merchant X in zip codes 1, 2, 3 and 5 in the last 30 days. In some embodiments, the value for merchant X can be substituted with an actual merchant name or identifier and the zip codes specified can be replaced with zip codes of interest for the named merchant.
The replacement of various placeholder values in the model transaction aggregates 330 can occur at various levels of detail depending on the needs and practices of the requesting entity. For example, advertiser 205 may be an online advertiser who is partnered with an online search engine with keyword-trigger advertising that can detect various keywords in users' web-based e-mail or web browsing behavior. In such programs, advertiser 205 can specify to the online search engine which keywords coming from a specific set of IP addresses, should trigger the display of one or more advertisements specified by advertiser 205. The IP addresses can be defined by a geographic region that can be referenced by a range of addresses or ZIP codes. Specifically, advertiser 205, who may be engaged in an advertising campaign for camping equipment, can specify that one of five predetermined camping equipment advertisements should be displayed to any users who read or send e-mail using a browser-based Web e-mail program using the words “camping” or “kayaking” for any and all online traffic generated from a specific range of IP addresses associated or related to zip codes 94114, 94111, 94110 and 94119. The use of zip codes to identify a specific range of IP addresses is only one example of how such keyword-trigger advertising can be directed at specific group characteristics. Any designation of geographic area or other group characteristic can be used to specify a specific set or range of IP addresses for the targeted online marketing. The advertising campaign can go on indefinitely or for some predetermined amount of time depending on the goals of advertiser 205.
At any point before, during or after a particular advertising or marketing campaign, such as the keyword-trigger, IP address specific advertising campaign described above, publisher 203, advertiser 205 or merchant 207 can request various transaction level aggregates from aggregator 237 to test the potential, progress or effectiveness of the campaign. For example, prior to sending out a paper-based mailer or marketing campaign to a specific set of potential consumers defined by one or more specific or general group characteristics, like home address, zip code and age, the requesting entity might like to know the total dollar amount spent at a specific merchant type by consumers in that age group residing in the zip codes of interest. If the requesting entity discovers that the spending trend among consumers in the age group and zip codes of interest, such as 35 to 40-year-olds in the San Francisco Bay Area, in the specified merchant type, such as furniture stores, has been increasing, then it may be effective to send a mailer along with a coupon to the 35 to 40-year-olds within a certain radius of their furniture store. The spending trend information can be obtained using one or more predefined or requesting entity customized transaction level aggregates. Such aggregates give requesting entities more insight into the potential buying behavior and past spending habits using fewer resources and time than used to be required using consumer surveys and merchant-by-merchant sales trending. Additionally, providing transaction level data aggregates according to various embodiments of the present invention allows for real time, or near to real time, analysis of progress of a particular advertisement or promotional campaign. Not only is the information provided in the transaction aggregates in various embodiments of the present invention more timely than previously possible, it can also provide much more specific and targeted data with more meaningful and useful metrics at costs far less than any other type of data mining currently available.
The data flow shown within system 400 begins when aggregator 237 receives the linkage response file from one or more data sources. Using the linkage response file, aggregator 237 can create a transaction data request file. Aggregator 237 can then send the transaction data request file to transaction database 235 in step 31. Transaction database 235 can be any type of transaction database and can also be part of a transaction processing network, such as a credit card payment processing network or other financial transaction processing network. Transaction database 235 can then parse the transaction data request file to determine for which accounts it should retrieve transaction data. The transaction data can include any information associated with an individual transaction identified or associated with an account or account identifier. As shown, transaction data 405 can include individual records including data such as an account number, an issuer identifier, the date of the transaction, the amount of the transaction, the type of the transaction, a merchant identifier, the location of the transaction and whether not the funds were available for the transaction indicating whether or not the transaction was completed or not. The type of information available for each transaction record can vary depending on the transaction database 235 and the type of information reported can vary depending on the requested information specified in the transaction data inquiry file. Transaction database 235 can then compile the transaction data 405 into a transaction data response file and send it back to aggregator 237 in step 32.
At some time before or after aggregator 237 receives the transaction data response file, it can then retrieve from memory 320 one or more transaction aggregate specifications or templates in step 33. The transaction aggregate specifications or templates retrieved from memory 320 can be requesting entity-defined or selected from a set of model transaction aggregates 330 discussed in reference to previously discussed
Aggregator 237 can use one or more processors 310 to read the particular transaction aggregates or transaction aggregate templates of interest and process the transaction data response file to compile the requested transaction aggregates. Once the transaction aggregates are compiled, aggregator 237 can create a report 420 compiling all or some of the requested transaction aggregates in step 34. Report 420 can then be sent to merchant 207 or any other requesting entity in step 35. The report 420 can be sent over any suitable electronic communication medium capable of quickly and reliably transmitting large amounts of data. Alternatively, the report 420 can be sent using traditional paper based messaging services such a traditional postal service.
Assuming that the transaction aggregate 1 510 represents the total amount spent by the consumers with credit card billing addresses in the specified zip code at camping supply type stores in the last seven days and aggregate 2 520 is the percentage of all credit card transactions in that same specified zip code that aggregate 1 510 represents, then the advertiser might want to concentrate on zip code 5 shown on line 545 to get a larger share of that potential market of camping supply expenditures for camping supply store A. On the other hand, the advertiser may want to target zip code 3 shown on line 535, since it has large dollar amount of camping supply type purchases but makes up a lower percentage of the total credit card purchases, indicating there are more potential sales to be captured in that zip code. The manner in which the advertiser orders and uses aggregate 1 510 and aggregate 2 520 and other transaction aggregates can depend on objective and/or goals of the advertiser.
In other embodiments, an advertiser might like to measure progress of an ongoing promotion or the effectiveness of a completed marketing campaign, such as the mailer campaign described above, by ordering periodic or final transaction aggregates to use in trending studies or comparisons with past aggregates. For example the transaction aggregates in 500B might be ordered seven days after it is determined that the mailer promotion has been delivered to the majority of consumers in the target zip codes. Information shown in the transaction aggregates can then be compared to transaction aggregates ordered prior to the beginning of the mailer campaign. This information can be used to measure the effectiveness of the mailer campaign and possibly further refine future mailer campaigns sent to zip codes covered by the transaction aggregates in 500B. To refine future advertising or marketing campaigns or to measure the effectiveness of past advertising or marketing campaigns, information requesters such as advertisers, publishers and merchants, can design transaction aggregates with combined group characteristics to analyze the spending behavior of consumers associated with those group characteristics.
As shown, Venn diagram 600 includes three main categories: the number of consumers having a various group characteristics who made a single purchase greater than $500 at a particular merchant's outlet is represented by circle 610; the number of consumers having various group characteristics who spent more than $1000 in the last 30 days at a particular merchant's outlets is represented by circle 620; finally circle 630 represents the number of consumers who visited a particular merchant's outlets multiple times in the last 30 days. As can be seen, various individual consumers might fit into one or more of categories 610, 620 and 630. These overlaps are represented by regions 651, 653, 655 and 657. By analyzing the Venn diagram 600, a merchant can determine that consumers who spent more than $500 a time and spent $1000 more in the last 30 days over multiple visits would be represented by consumers falling within the region 657.
The merchant can then analyze the underlying group characteristics of those consumers within the region 657 to determine a geographic, demographic or other group characteristic to help determine future trends of spending for those consumers. Alternatively, other uses of transaction aggregates provided by various embodiments of the present invention as represented by Venn diagram 600 can also be used to analyze the effectiveness during or after a particular marketing or advertising campaign.
The ability to create transaction aggregates associated with user accounts identified at the group characteristic level allows requesting entities to process the effectiveness of marketing and advertising campaigns based on the completion of actual transactions. Transaction databases can be used to collect transaction level data to determine exactly where transactions are completed by looking at the specifics of each transaction record. This information can then be correlated back to the target group characteristic to determine if there was a sale resulting from the campaign. Thus, if an advertiser is looking to increase sales at a particular merchant, then the advertiser can look at completed transactions at that merchant as they relate to group characteristics of consumers at whom various marketing and advertising campaigns were targeted. Embodiments of the present invention discussed above have the advantage of being able to correlate information identifying specific groups of consumers to specific marketing and advertising campaigns and subsequently being able to analyze the effectiveness of those campaigns based on actual transaction data at the group characteristic level. Again, the group characteristics can include any characteristic of one or more consumers linked to individual transactions in the transaction database. As such, embodiments of the present invention can include group characteristics currently collected at the transaction level and group characteristics that may be added based on their usefulness for future marketing and advertising campaigns.
For example, current transaction level data for credit card or debit card transactions include date, time, location and account number or other identifiers. The account number or other identifier can be used to specifically identify other characteristics of the account holder. For instance, when any accounts are opened, issuers can collect the account holder's date of birth, billing address, sex and other group characteristic and demographic information. Such information can be called upon by various information requesters to identify user accounts and, from that starting point, send a collection of user accounts to transaction database to pull all transactions associated with those user accounts for any given period stored within the transaction database.
System 700 is representative of a computer system capable of embodying the present invention. The computer system can be present in any of the elements in
In one embodiment, computer system 700 typically includes a display 710, computer 720, a keyboard 730, a user input device 740, computer interfaces 750, and the like. In various embodiments, display (monitor) 710 may be embodied as a CRT display, an LCD display, a plasma display, a direct-projection or rear-projection DLP, a microdisplay, or the like. In various embodiments, display 710 may be used to display user interfaces and rendered images.
In various embodiments, user input device 740 is typically embodied as a computer mouse, a trackball, a track pad, a joystick, wireless remote, drawing tablet, voice command system, and the like. User input device 740 typically allows a user to select objects, icons, text and the like that appear on the display 710 via a command such as a click of a button or the like. An additional specialized user input device 745, such a magnetic stripe, RFID transceiver or smart card reader may also be provided in various embodiments. In other embodiments, user input device 745 include additional computer system displays (e.g. multiple monitors). Further user input device 745 may be implemented as one or more graphical user interfaces on such a display.
Embodiments of computer interfaces 750 typically include an Ethernet card, a modem (telephone, satellite, cable, ISDN), (asynchronous) digital subscriber line (DSL) unit, FireWire interface, USB interface, and the like. For example, computer interfaces 750 may be coupled to a computer network, to a FireWire bus, or the like. In other embodiments, computer interfaces 750 may be physically integrated on the motherboard of computer 720, may be a software program, such as soft DSL, or the like.
RAM 770 and disk drive 780 are examples of computer-readable tangible media configured to store data such user, account and transaction level data, calculated aggregated data, super keys, sub keys and other executable computer code, human readable code, or the like. Other types of tangible media include magnetic storage media such as floppy disks, networked hard disks, or removable hard disks; optical storage media such as CD-ROMS, DVDs, holographic memories, or bar codes; semiconductor media such as flash memories, read-only-memories (ROMS); battery-backed volatile memories; networked storage devices, and the like.
In the present embodiment, computer system 700 may also include software that enables communications over a network such as the HTTP, TCP/IP, RTP/RTSP protocols, and the like. In alternative embodiments of the present invention, other communications software and transfer protocols may also be used, for example IPX, UDP or the like.
In various embodiments, computer 720 typically includes familiar computer components such as a processor 760, and memory storage devices, such as a random access memory (RAM) 770, disk drives 780, and system bus 790 interconnecting the above components.
In some embodiments, computer 720 includes one or more Xeon microprocessors from Intel. Further, in the present embodiment, computer 720 typically includes a UNIX-based operating system.
It should be understood that embodiments of the present invention as described above can be implemented in the form of control logic using computer software in a modular or integrated manner. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will know and appreciate other ways and/or methods to implement the present invention using hardware and a combination of hardware and software.
Any of the software components or functions described in this application, may be implemented as software code to be executed by a processor using any suitable computer language such as, for example, Java, C++ or Perl using, for example, conventional or object-oriented techniques. The software code may be stored as a series of instructions, or commands on a computer readable medium, such as a random access memory (RAM), a read only memory (ROM), a magnetic medium such as a hard-drive or a floppy disk, or an optical medium such as a CD-ROM. Any such computer readable medium may reside on or within a single computational apparatus, and may be present on or within different computational apparatuses within a system or network.
The above description is illustrative and is not restrictive. Many variations of the invention will become apparent to those skilled in the art upon review of the disclosure. The scope of the invention should, therefore, be determined not with reference to the above description, but instead should be determined with reference to the pending claims along with their full scope or equivalents.
One or more features from any embodiment may be combined with one or more features of any other embodiment without departing from the scope of the invention.
A recitation of “a”, “an” or “the” is intended to mean “one or more” unless specifically indicated to the contrary.
This Application claims priority to U.S. Provisional Patent Application No. 61/258,462 filed on Nov. 5, 2009. This provisional application is herein incorporated by reference in its entirety for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
4914590 | Loatman et al. | Apr 1990 | A |
5401946 | Weinblatt | Mar 1995 | A |
5592560 | Deaton et al. | Jan 1997 | A |
5621812 | Deaton et al. | Apr 1997 | A |
5638457 | Deaton et al. | Jun 1997 | A |
5675510 | Coffey et al. | Oct 1997 | A |
5684990 | Boothby | Nov 1997 | A |
5687322 | Deaton et al. | Nov 1997 | A |
5692017 | Shiokawa | Nov 1997 | A |
5710886 | Christensen et al. | Jan 1998 | A |
5717923 | Dedrick | Feb 1998 | A |
5924080 | Johnson et al. | Jul 1999 | A |
5974396 | Anderson et al. | Oct 1999 | A |
6012094 | Leymann et al. | Jan 2000 | A |
6035280 | Christensen et al. | Mar 2000 | A |
6055573 | Gardenswartz et al. | Apr 2000 | A |
6061660 | Eggleston et al. | May 2000 | A |
6070147 | Harms et al. | May 2000 | A |
6101484 | Halbert et al. | Aug 2000 | A |
6119101 | Peckover | Sep 2000 | A |
6216129 | Eldering | Apr 2001 | B1 |
6282516 | Giuliani | Aug 2001 | B1 |
6282522 | Davis | Aug 2001 | B1 |
6285983 | Jenkins | Sep 2001 | B1 |
6298330 | Gardenswartz | Oct 2001 | B1 |
6307958 | Deaton et al. | Oct 2001 | B1 |
6321201 | Jenkins | Nov 2001 | B1 |
6324519 | Eldering | Nov 2001 | B1 |
6332126 | Peirce et al. | Dec 2001 | B1 |
6334110 | Walter et al. | Dec 2001 | B1 |
6377935 | Deaton et al. | Apr 2002 | B1 |
6430539 | Lazarus et al. | Aug 2002 | B1 |
6450407 | Freeman et al. | Sep 2002 | B1 |
6505168 | Rothman | Jan 2003 | B1 |
6519571 | Guheen | Feb 2003 | B1 |
6604089 | Van Horn et al. | Aug 2003 | B1 |
6604239 | Kohen | Aug 2003 | B1 |
6631356 | Van Horn et al. | Oct 2003 | B1 |
6631372 | Graham | Oct 2003 | B1 |
6658393 | Basch et al. | Dec 2003 | B1 |
6742003 | Heckerman et al. | May 2004 | B2 |
6834110 | Marconcini et al. | Dec 2004 | B1 |
6839682 | Blume et al. | Jan 2005 | B1 |
6856992 | Britton et al. | Feb 2005 | B2 |
6873979 | Fishman et al. | Mar 2005 | B2 |
6901406 | Nabe | May 2005 | B2 |
6922686 | Okamoto et al. | Jul 2005 | B2 |
6925441 | Jones et al. | Aug 2005 | B1 |
6934508 | Ceresoli et al. | Aug 2005 | B2 |
6934690 | Van Horn et al. | Aug 2005 | B1 |
6938022 | Singhal | Aug 2005 | B1 |
6941376 | Mitchell et al. | Sep 2005 | B2 |
6996560 | Choi | Feb 2006 | B1 |
7003476 | Samra | Feb 2006 | B1 |
7024374 | Day | Apr 2006 | B1 |
7024409 | Iyengar | Apr 2006 | B2 |
7028052 | Chapman et al. | Apr 2006 | B2 |
7035855 | Kilger et al. | Apr 2006 | B1 |
7039599 | Merriman | May 2006 | B2 |
7062510 | Eldering | Jun 2006 | B1 |
7072847 | Ulenas et al. | Jul 2006 | B2 |
7107230 | Halbert et al. | Sep 2006 | B1 |
7107249 | Dively | Sep 2006 | B2 |
7120590 | Eisen | Oct 2006 | B1 |
7124099 | Mesaros | Oct 2006 | B2 |
7146330 | Alon et al. | Dec 2006 | B1 |
7158943 | Van Der Riet | Jan 2007 | B2 |
7158955 | Diveley | Jan 2007 | B2 |
7162436 | Eckel, Jr. | Jan 2007 | B1 |
7165037 | Lazarus et al. | Jan 2007 | B2 |
7177822 | Mahmood et al. | Feb 2007 | B2 |
7181412 | Fulgoni et al. | Feb 2007 | B1 |
7181419 | Mesaros | Feb 2007 | B1 |
7194422 | St. John Killick | Mar 2007 | B1 |
7194427 | Van Horn et al. | Mar 2007 | B1 |
7225142 | Apte | May 2007 | B1 |
7260837 | Abraham | Aug 2007 | B2 |
7263498 | Van Horn et al. | Aug 2007 | B1 |
7264152 | Tsuei et al. | Sep 2007 | B2 |
7269578 | Sweeney | Sep 2007 | B2 |
7299194 | Manganaris | Nov 2007 | B1 |
7328169 | Temares | Feb 2008 | B2 |
7333998 | Heckerman et al. | Feb 2008 | B2 |
7337127 | Smith | Feb 2008 | B1 |
7340438 | Nordman et al. | Mar 2008 | B2 |
7360251 | Spalink et al. | Apr 2008 | B2 |
7363246 | Van Horn et al. | Apr 2008 | B1 |
7373311 | Lambert et al. | May 2008 | B2 |
7401731 | Pletz et al. | Jul 2008 | B1 |
7424439 | Fayyad et al. | Sep 2008 | B1 |
7424441 | George | Sep 2008 | B2 |
7444658 | Matz et al. | Oct 2008 | B1 |
7451134 | Krakowiecki et al. | Nov 2008 | B2 |
7480627 | Van Horn et al. | Jan 2009 | B1 |
7490052 | Kilger et al. | Feb 2009 | B2 |
7493655 | Brown | Feb 2009 | B2 |
7526485 | Hagan et al. | Apr 2009 | B2 |
7533038 | Blume | May 2009 | B2 |
7533130 | Narayana et al. | May 2009 | B2 |
7536360 | Stolfo et al. | May 2009 | B2 |
7542993 | Satterfield et al. | Jun 2009 | B2 |
7552069 | Kepecs | Jun 2009 | B2 |
7562030 | Shapira | Jul 2009 | B1 |
7578430 | Michelsen | Aug 2009 | B2 |
7578435 | Suk | Aug 2009 | B2 |
7580884 | Cook | Aug 2009 | B2 |
7593871 | Mesaros | Sep 2009 | B1 |
7613628 | Ariff et al. | Nov 2009 | B2 |
7668832 | Yeh et al. | Feb 2010 | B2 |
7689463 | Mesaros | Mar 2010 | B1 |
7689469 | Mesaros | Mar 2010 | B1 |
7693748 | Mesaros | Apr 2010 | B1 |
7729945 | Katz et al. | Jun 2010 | B1 |
7729977 | Xiao | Jun 2010 | B2 |
7747473 | Mesaros | Jun 2010 | B1 |
7828206 | Hessburg et al. | Nov 2010 | B2 |
7904337 | Morsa | Mar 2011 | B2 |
7917388 | Van Der Riet | Mar 2011 | B2 |
7937286 | Newman et al. | May 2011 | B2 |
7953219 | Freedman et al. | May 2011 | B2 |
7996521 | Chamberlain et al. | Aug 2011 | B2 |
8010337 | Narayanan et al. | Aug 2011 | B2 |
8055536 | Olaiya et al. | Nov 2011 | B1 |
8073950 | Goodermote et al. | Dec 2011 | B2 |
8086528 | Barrett et al. | Dec 2011 | B2 |
8103545 | Ramer et al. | Jan 2012 | B2 |
8131875 | Chen et al. | Mar 2012 | B1 |
8140389 | Altberg et al. | Mar 2012 | B2 |
8175908 | Anderson | May 2012 | B1 |
8255268 | Rane et al. | Aug 2012 | B2 |
20010027413 | Bhutta | Oct 2001 | A1 |
20010049620 | Blasko | Dec 2001 | A1 |
20020004733 | Addante | Jan 2002 | A1 |
20020032602 | Lanzillo et al. | Mar 2002 | A1 |
20020032904 | Lerner | Mar 2002 | A1 |
20020042738 | Srinivasanet et al. | Apr 2002 | A1 |
20020046187 | Vargaset et al. | Apr 2002 | A1 |
20020053076 | Landesmann | May 2002 | A1 |
20020059100 | Shore | May 2002 | A1 |
20020065723 | Anderson et al. | May 2002 | A1 |
20020072931 | Card | Jun 2002 | A1 |
20020099649 | Lee et al. | Jul 2002 | A1 |
20020107738 | Beach et al. | Aug 2002 | A1 |
20020123928 | Eldering et al. | Sep 2002 | A1 |
20020128908 | Levin et al. | Sep 2002 | A1 |
20020138346 | Kodaka | Sep 2002 | A1 |
20020147645 | Alao et al. | Oct 2002 | A1 |
20020147670 | Lange | Oct 2002 | A1 |
20020161625 | Brito-Valladares et al. | Oct 2002 | A1 |
20020174013 | Freeman et al. | Nov 2002 | A1 |
20030004808 | Elhaoussine et al. | Jan 2003 | A1 |
20030018652 | Heckerman et al. | Jan 2003 | A1 |
20030047602 | Iida et al. | Mar 2003 | A1 |
20030061132 | Yu, Sr. et al. | Mar 2003 | A1 |
20030074267 | Acharya et al. | Apr 2003 | A1 |
20030078864 | Hardesty et al. | Apr 2003 | A1 |
20030115113 | Duncan | Jun 2003 | A1 |
20030191832 | Satyavolu et al. | Oct 2003 | A1 |
20030225659 | Breeden et al. | Dec 2003 | A1 |
20040010458 | Friedman | Jan 2004 | A1 |
20040019518 | Abraham | Jan 2004 | A1 |
20040024632 | Perry | Feb 2004 | A1 |
20040039742 | Barsness et al. | Feb 2004 | A1 |
20040054581 | Redford | Mar 2004 | A1 |
20040054591 | Spaeth et al. | Mar 2004 | A1 |
20040073482 | Wiggins et al. | Apr 2004 | A1 |
20040107123 | Haffner et al. | Jun 2004 | A1 |
20040122735 | Meshkin | Jun 2004 | A1 |
20040122736 | Strock et al. | Jun 2004 | A1 |
20040127192 | Ceresoli et al. | Jul 2004 | A1 |
20040133474 | Tami et al. | Jul 2004 | A1 |
20040181554 | Heckerman et al. | Sep 2004 | A1 |
20040193489 | Boyd et al. | Sep 2004 | A1 |
20040193685 | Proehl | Sep 2004 | A1 |
20040225509 | Andre | Nov 2004 | A1 |
20040225603 | Allen et al. | Nov 2004 | A1 |
20040249650 | Freedman et al. | Dec 2004 | A1 |
20050021397 | Cui et al. | Jan 2005 | A1 |
20050055275 | Newman et al. | Mar 2005 | A1 |
20050071225 | Bortolin et al. | Mar 2005 | A1 |
20050071227 | Hammad et al. | Mar 2005 | A1 |
20050071230 | Mankoff | Mar 2005 | A1 |
20050071307 | Snyder | Mar 2005 | A1 |
20050131762 | Bharat et al. | Jun 2005 | A1 |
20050131792 | Rowe | Jun 2005 | A1 |
20050149455 | Bruesewitz et al. | Jul 2005 | A1 |
20050160002 | Roetter | Jul 2005 | A1 |
20050160003 | Berardi et al. | Jul 2005 | A1 |
20050197954 | Maitland et al. | Sep 2005 | A1 |
20050216823 | Petersen et al. | Sep 2005 | A1 |
20060053056 | Alspach-Goss et al. | Mar 2006 | A1 |
20060069619 | Walker et al. | Mar 2006 | A1 |
20060143071 | Hofmann | Jun 2006 | A1 |
20060143075 | Carr et al. | Jun 2006 | A1 |
20060161527 | Dwork et al. | Jul 2006 | A1 |
20060167818 | Wentker et al. | Jul 2006 | A1 |
20060178957 | LeClaire | Aug 2006 | A1 |
20060190337 | Ayers, Jr. | Aug 2006 | A1 |
20060218038 | Grider | Sep 2006 | A1 |
20060218087 | Zimmerman | Sep 2006 | A1 |
20060230053 | Eldering | Oct 2006 | A1 |
20060242047 | Haggerty et al. | Oct 2006 | A1 |
20060242051 | Haggerty et al. | Oct 2006 | A1 |
20060253320 | Heywood | Nov 2006 | A1 |
20060253323 | Phan et al. | Nov 2006 | A1 |
20060265280 | Nakada et al. | Nov 2006 | A1 |
20060265429 | Pendergast | Nov 2006 | A1 |
20060287916 | Starr et al. | Dec 2006 | A1 |
20060293948 | Weinblatt | Dec 2006 | A1 |
20070011194 | Gurevich | Jan 2007 | A1 |
20070033104 | Collins et al. | Feb 2007 | A1 |
20070038516 | Apple et al. | Feb 2007 | A1 |
20070055597 | Patel | Mar 2007 | A1 |
20070067297 | Kublickis et al. | Mar 2007 | A1 |
20070073585 | Apple et al. | Mar 2007 | A1 |
20070084917 | Fajkowski | Apr 2007 | A1 |
20070100691 | Patterson et al. | May 2007 | A1 |
20070100719 | Chwast et al. | May 2007 | A1 |
20070124201 | Hu et al. | May 2007 | A1 |
20070140483 | Jin et al. | Jun 2007 | A1 |
20070156517 | Kaplan et al. | Jul 2007 | A1 |
20070162377 | Williams | Jul 2007 | A1 |
20070162457 | Barcia et al. | Jul 2007 | A1 |
20070168246 | Haggerty et al. | Jul 2007 | A1 |
20070174295 | Abraham | Jul 2007 | A1 |
20070185844 | Schachter | Aug 2007 | A1 |
20070192121 | Routson | Aug 2007 | A1 |
20070192122 | Routson et al. | Aug 2007 | A1 |
20070214076 | Robida et al. | Sep 2007 | A1 |
20070219865 | Leining | Sep 2007 | A1 |
20070219866 | Wolf et al. | Sep 2007 | A1 |
20070220030 | Bollinger et al. | Sep 2007 | A1 |
20070226056 | Belanger | Sep 2007 | A1 |
20070226061 | Chen et al. | Sep 2007 | A1 |
20070233571 | Eldering et al. | Oct 2007 | A1 |
20070239532 | Benson et al. | Oct 2007 | A1 |
20070244741 | Blume | Oct 2007 | A1 |
20070260521 | Van Der Riet | Nov 2007 | A1 |
20070260736 | Miller | Nov 2007 | A1 |
20070265923 | Krassner et al. | Nov 2007 | A1 |
20070282681 | Shubert et al. | Dec 2007 | A1 |
20080004884 | Flake | Jan 2008 | A1 |
20080021772 | Aloni et al. | Jan 2008 | A1 |
20080033852 | Megdal et al. | Feb 2008 | A1 |
20080046358 | Holm-Blagg | Feb 2008 | A1 |
20080059302 | Fordyce, III | Mar 2008 | A1 |
20080059303 | Fordyce, III | Mar 2008 | A1 |
20080059306 | Fordyce, III | Mar 2008 | A1 |
20080059307 | Fordyce, III | Mar 2008 | A1 |
20080065507 | Morrison et al. | Mar 2008 | A1 |
20080071571 | Kim et al. | Mar 2008 | A1 |
20080071587 | Granucci et al. | Mar 2008 | A1 |
20080071680 | Sheets | Mar 2008 | A1 |
20080077487 | Davis | Mar 2008 | A1 |
20080077499 | Ariff et al. | Mar 2008 | A1 |
20080082393 | Ozzie et al. | Apr 2008 | A1 |
20080082397 | Dennison et al. | Apr 2008 | A1 |
20080082418 | Fordyce, III | Apr 2008 | A1 |
20080091720 | Klumpp et al. | Apr 2008 | A1 |
20080103887 | Oldham | May 2008 | A1 |
20080103888 | Weir | May 2008 | A1 |
20080120182 | Arnold et al. | May 2008 | A1 |
20080120218 | Reid et al. | May 2008 | A1 |
20080133351 | White et al. | Jun 2008 | A1 |
20080134228 | Dion et al. | Jun 2008 | A1 |
20080147731 | Narayana et al. | Jun 2008 | A1 |
20080154703 | Flake | Jun 2008 | A1 |
20080154704 | Flake | Jun 2008 | A1 |
20080154727 | Carlson | Jun 2008 | A1 |
20080162258 | Kala et al. | Jul 2008 | A1 |
20080162269 | Gilbert | Jul 2008 | A1 |
20080167991 | Carlson et al. | Jul 2008 | A1 |
20080167992 | Kokernak | Jul 2008 | A1 |
20080177602 | Sopher et al. | Jul 2008 | A1 |
20080184117 | Alsbury et al. | Jul 2008 | A1 |
20080189202 | Zadoorian et al. | Aug 2008 | A1 |
20080195465 | Redmond et al. | Aug 2008 | A1 |
20080195473 | Laramy | Aug 2008 | A1 |
20080201226 | Carlson | Aug 2008 | A1 |
20080215436 | Roberts et al. | Sep 2008 | A1 |
20080217397 | Degliantoni et al. | Sep 2008 | A1 |
20080221970 | Megdal et al. | Sep 2008 | A1 |
20080221971 | Megdal et al. | Sep 2008 | A1 |
20080221972 | Megdal et al. | Sep 2008 | A1 |
20080221973 | Megdal et al. | Sep 2008 | A1 |
20080221990 | Megdal et al. | Sep 2008 | A1 |
20080222015 | Megdal et al. | Sep 2008 | A1 |
20080222027 | Megdal et al. | Sep 2008 | A1 |
20080228538 | Megdal et al. | Sep 2008 | A1 |
20080228539 | Megdal et al. | Sep 2008 | A1 |
20080228540 | Megdal et al. | Sep 2008 | A1 |
20080228556 | Megdal et al. | Sep 2008 | A1 |
20080228635 | Megdal et al. | Sep 2008 | A1 |
20080235243 | Lee et al. | Sep 2008 | A1 |
20080242317 | Abhyanker | Oct 2008 | A1 |
20080243680 | Megdal et al. | Oct 2008 | A1 |
20080275771 | Levine | Nov 2008 | A1 |
20080281668 | Nurminen | Nov 2008 | A1 |
20080281699 | Whitehead | Nov 2008 | A1 |
20080300973 | DeWitt et al. | Dec 2008 | A1 |
20080301037 | Monk | Dec 2008 | A1 |
20080301102 | Liang | Dec 2008 | A1 |
20080306790 | Otto | Dec 2008 | A1 |
20080318559 | Porco et al. | Dec 2008 | A1 |
20080319843 | Moser | Dec 2008 | A1 |
20080319847 | Shepard | Dec 2008 | A1 |
20080320512 | Knight | Dec 2008 | A1 |
20090006363 | Canny | Jan 2009 | A1 |
20090018895 | Weinblatt | Jan 2009 | A1 |
20090030793 | Fordyce, III | Jan 2009 | A1 |
20090036103 | Byerley et al. | Feb 2009 | A1 |
20090043593 | Herbrich et al. | Feb 2009 | A1 |
20090048884 | Olives et al. | Feb 2009 | A1 |
20090070219 | D'Angelo | Mar 2009 | A1 |
20090070225 | Matz et al. | Mar 2009 | A1 |
20090076896 | DeWitt et al. | Mar 2009 | A1 |
20090112703 | Brown | Apr 2009 | A1 |
20090112721 | Hammad et al. | Apr 2009 | A1 |
20090119160 | Woda | May 2009 | A1 |
20090119167 | Kendall | May 2009 | A1 |
20090119170 | Hammad et al. | May 2009 | A1 |
20090125396 | Otto et al. | May 2009 | A1 |
20090125439 | Zarikian et al. | May 2009 | A1 |
20090132347 | Anderson et al. | May 2009 | A1 |
20090132365 | Gruenhagen et al. | May 2009 | A1 |
20090132366 | Lam | May 2009 | A1 |
20090132395 | Lam | May 2009 | A1 |
20090132404 | King et al. | May 2009 | A1 |
20090144122 | Ginsberg et al. | Jun 2009 | A1 |
20090144146 | Levine et al. | Jun 2009 | A1 |
20090144201 | Gierkink et al. | Jun 2009 | A1 |
20090157511 | Spinnell | Jun 2009 | A1 |
20090157512 | King | Jun 2009 | A1 |
20090172551 | Kane | Jul 2009 | A1 |
20090172728 | Shkedi et al. | Jul 2009 | A1 |
20090182625 | Kilger et al. | Jul 2009 | A1 |
20090187462 | Gevelber et al. | Jul 2009 | A1 |
20090192882 | Narahashi | Jul 2009 | A1 |
20090204472 | Einhorn | Aug 2009 | A1 |
20090216579 | Zen et al. | Aug 2009 | A1 |
20090216606 | Coffman et al. | Aug 2009 | A1 |
20090216616 | Wang et al. | Aug 2009 | A1 |
20090222323 | Kelly | Sep 2009 | A1 |
20090222373 | Choudhuri et al. | Sep 2009 | A1 |
20090234708 | Heiser, II | Sep 2009 | A1 |
20090234711 | Ramer et al. | Sep 2009 | A1 |
20090234715 | Heiser et al. | Sep 2009 | A1 |
20090234737 | Sarelson | Sep 2009 | A1 |
20090248496 | Hueter | Oct 2009 | A1 |
20090248497 | Hueter | Oct 2009 | A1 |
20090248511 | Mehta et al. | Oct 2009 | A1 |
20090249384 | Fang et al. | Oct 2009 | A1 |
20090254414 | Schwarz et al. | Oct 2009 | A1 |
20090254476 | Sharma | Oct 2009 | A1 |
20090259518 | Harvey | Oct 2009 | A1 |
20090271305 | Lal et al. | Oct 2009 | A1 |
20090271327 | Lal | Oct 2009 | A1 |
20090271428 | Adelman et al. | Oct 2009 | A1 |
20090276317 | Dixon et al. | Nov 2009 | A1 |
20090292619 | Kagan et al. | Nov 2009 | A1 |
20090299846 | Brueggemann et al. | Dec 2009 | A1 |
20100030644 | Dhamodharan | Feb 2010 | A1 |
20100042517 | Paintin et al. | Feb 2010 | A1 |
20100049620 | Debow | Feb 2010 | A1 |
20100057549 | Boal | Mar 2010 | A1 |
20100057586 | Chow | Mar 2010 | A1 |
20100106568 | Grimes | Apr 2010 | A1 |
20100106569 | Grimes | Apr 2010 | A1 |
20100114677 | Carlson | May 2010 | A1 |
20100114683 | Wessels | May 2010 | A1 |
20100114686 | Carlson | May 2010 | A1 |
20100125546 | Barrett et al. | May 2010 | A1 |
20100125547 | Barrett et al. | May 2010 | A1 |
20100153242 | Preston | Jun 2010 | A1 |
20100161379 | Bene et al. | Jun 2010 | A1 |
20100174607 | Henkin et al. | Jul 2010 | A1 |
20100174623 | McPhie et al. | Jul 2010 | A1 |
20100191594 | White et al. | Jul 2010 | A1 |
20100250338 | Banerjee | Sep 2010 | A1 |
20100257404 | Singh et al. | Oct 2010 | A1 |
20100274625 | Carlson | Oct 2010 | A1 |
20100274627 | Carlson | Oct 2010 | A1 |
20100280880 | Faith | Nov 2010 | A1 |
20100280881 | Faith | Nov 2010 | A1 |
20100280882 | Faith | Nov 2010 | A1 |
20100280927 | Faith | Nov 2010 | A1 |
20100280950 | Faith | Nov 2010 | A1 |
20100306029 | Jolley | Dec 2010 | A1 |
20100306032 | Jolley | Dec 2010 | A1 |
20110016103 | Sivakumar et al. | Jan 2011 | A1 |
20110022424 | Von Derheide | Jan 2011 | A1 |
20110035278 | Fordyce, III | Feb 2011 | A1 |
20110035280 | Fordyce, III | Feb 2011 | A1 |
20110035288 | Clyne | Feb 2011 | A1 |
20110047072 | Ciurea | Feb 2011 | A1 |
20110087519 | Fordyce, III | Apr 2011 | A1 |
20110087530 | Fordyce, III | Apr 2011 | A1 |
20110087531 | Winters et al. | Apr 2011 | A1 |
20110087546 | Fordyce, III | Apr 2011 | A1 |
20110087547 | Amaro et al. | Apr 2011 | A1 |
20110087550 | Fordyce, III | Apr 2011 | A1 |
20110093324 | Fordyce, III et al. | Apr 2011 | A1 |
20110093327 | Fordyce, III et al. | Apr 2011 | A1 |
20110093335 | Fordyce, III et al. | Apr 2011 | A1 |
20110125565 | MacIlwaine et al. | May 2011 | A1 |
20110238538 | Allison et al. | Sep 2011 | A1 |
20110276383 | Heiser et al. | Nov 2011 | A1 |
20110288918 | Cervenka | Nov 2011 | A1 |
20110302022 | Fordyce, III | Dec 2011 | A1 |
20110302036 | Fordyce, III | Dec 2011 | A1 |
20110302039 | Fordyce, III | Dec 2011 | A1 |
20120109709 | Fordyce, III et al. | May 2012 | A1 |
20120109734 | Fordyce, III et al. | May 2012 | A1 |
20120185315 | Von Derheide et al. | Jul 2012 | A1 |
20120191525 | Singh | Jul 2012 | A1 |
20120215610 | Amaro et al. | Aug 2012 | A1 |
Number | Date | Country |
---|---|---|
2000357204 | Dec 2000 | JP |
2001175761 | Jun 2001 | JP |
2003108897 | Apr 2003 | JP |
2006301866 | Nov 2006 | JP |
2007102340 | Apr 2007 | JP |
2007-219651 | Aug 2007 | JP |
2007317209 | Dec 2007 | JP |
1020000037128 | Jul 2000 | KR |
20020074271 | Sep 2002 | KR |
20030080797 | Oct 2003 | KR |
10-2004-0017547 | Feb 2004 | KR |
20040040253 | May 2004 | KR |
20040107715 | Dec 2004 | KR |
1020050024746 | Mar 2005 | KR |
1020070043329 | Apr 2005 | KR |
20050078135 | Aug 2005 | KR |
20050089523 | Sep 2005 | KR |
20060034983 | Apr 2006 | KR |
20060095895 | Sep 2006 | KR |
20070030415 | Mar 2007 | KR |
20070070588 | Jul 2007 | KR |
20070075986 | Jul 2007 | KR |
100761398 | Sep 2007 | KR |
20080104398 | Dec 2008 | KR |
100883700 | Feb 2009 | KR |
1020090016353 | Feb 2009 | KR |
1020090059922 | Jun 2009 | KR |
9922328 | May 1999 | WO |
9950775 | Oct 1999 | WO |
0062231 | Oct 2000 | WO |
0060435 | Oct 2000 | WO |
0062231 | Oct 2000 | WO |
0137183 | May 2001 | WO |
0137183 | May 2001 | WO |
0139023 | May 2001 | WO |
0157758 | Aug 2001 | WO |
0186378 | Nov 2001 | WO |
0193161 | Dec 2001 | WO |
0205116 | Jan 2002 | WO |
0214985 | Feb 2002 | WO |
0214985 | Feb 2002 | WO |
0219229 | Mar 2002 | WO |
0219229 | Mar 2002 | WO |
0242970 | May 2002 | WO |
02071187 | Sep 2002 | WO |
03025695 | Mar 2003 | WO |
03081376 | Oct 2003 | WO |
2005001631 | Jan 2005 | WO |
2005031513 | Apr 2005 | WO |
2005076181 | Aug 2005 | WO |
2006028739 | Mar 2006 | WO |
2006126205 | Nov 2006 | WO |
2007131258 | Nov 2007 | WO |
2007136221 | Nov 2007 | WO |
2008013945 | Jan 2008 | WO |
2008013945 | Jan 2008 | WO |
2008023912 | Feb 2008 | WO |
2008028154 | Mar 2008 | WO |
2008052073 | May 2008 | WO |
2008055217 | May 2008 | WO |
2008064343 | May 2008 | WO |
2008067543 | Jun 2008 | WO |
2008121286 | Oct 2008 | WO |
2008144643 | Nov 2008 | WO |
2008144643 | Nov 2008 | WO |
2010141270 | Dec 2010 | WO |
2011017613 | Feb 2011 | WO |
Entry |
---|
International Patent Application PCT/US2011/037769, International Search Report and Written Opinion, Janaury 9, 2012. |
“Google ad words Tacking Codes” Measuring Your Profits, AdWords Help, Google Corporation, Book excerpt pp. 1-2. Available: http://support.google.com/adwords/bin/answer.py?hl=en&answer=2404207&from=146309&rd=1. |
“Loyalty Solutions—Issuing Rewards Services” 2008, First Data Corporation. Available at http://www.firstdata.com/downloads/marketing-fs/fd—issuingrewards—ss.pdf. |
Carini, Robert, “Oracle's Complete Sell-Side E-Commerce Solution,” Apr. 30, 2008, 20 pages, available at http://www.oracle.com/us/products/applications/siebel/self-service-ebilling/038547.pdf. |
Georgiadis, Margo et al., “Smart data, smart decisions, smart profits: the retailer's advantage,” 22 pages, Feb. 8, 2005. Available at http://web.archive.org/web/20050208141921/http://www.mckinsey.com/practices/retail/knowledge/articles/smartdatasmartdecisions.pdf. |
Cashmore, Pete, “YouTube Ads: You Hate Em,” available at http://mashable.com/2009/04/05/youtube-ads-youhate-em/#, Apr. 5, 2009. |
International Patent Application PCT/US09/52766, International Search Report and Written Opinion, Mar. 11, 2010. |
International Patent Application PCT/US2010/036076, International Search Report & Written Opinion, Dec. 30, 2010. |
International Patent Application PCT/US2010/043440, International Search Report and Written Opinion, Feb. 24, 2011. |
International Patent Application PCT/US2010/044449, International Search Report and Written Opinion, Mar. 14, 2011. |
International Patent Application PCT/US2010/044459, International Search Report and Written Opinion, Mar. 28, 2011. |
International Patent Application PCT/US2010/044706, International Search Report and Written Opinion, Mar. 25, 2011. |
International Patent Application PCT/US2010/044779, International Search Report and Written Opinion, Mar. 31, 2011. |
International Patent Application PCT/US2010/044786, International Seach Report and Written Opinion, Mar. 17, 2011. |
International Patent Application PCT/US2010/045082, International Search Report and Written Opinion, Feb. 28, 2011. |
International Patent Application PCT/US2010/050504, International Seach Report and Written Opinion, Apr. 21, 2011. |
International Patent Application PCT/US2010/050923, International Seach Report and Written Opinion, Apr. 26, 2011. |
International Patent Application PCT/US2010/051262, International Seach Report and Written Opinion, May 30, 2011. |
International Patent Application PCT/US2010/051490, International Seach Report and Written Opinion, Apr. 21, 2011. |
International Patent Application PCT/US2010/051853, International Seach Report and Written Opinion, Jun. 21, 2011. |
International Patent Application PCT/US2010/052070, International Search Report and Written Opinion, May 31, 2011. |
International Patent Application PCT/US2010/053061, International Search Report and Written Opinion, May 30, 2011. |
Li, Wen-Syan, “Knowledge Gathering and Matching in Heterogeneous Databases,” Working Notes of the AAAI Spring Symposium on Information Gathering, pp. 116-1216, Mar. 27, 1995. |
Mielikäinen, Taneli, “Privacy Problems with Anonymized Transaction Databases,” 7th International Conference on Discovery Science, pp. 219-229, Oct. 2, 2004. |
Punj, Girish et al. “Cluster Analysis in Marketing Research: Review and Suggestions for Application,” Journal of Marketing Research, vol. 20, pp. 134-148, May 1983. |
Van Grove, Jennifer, “Are Your Online Video Ads Driving Actual Offline Purchases?”, available at http://mashable.com/2009/05/18/video-impact/#, May 18, 2009. |
International Patent Application PCT/US12/22417, International Search Report and Written Opinion, Aug. 9, 2012. |
International Patent Application PCT/US2012/031171, International Search Report and Written Opinion, Oct. 12, 2012. |
Number | Date | Country | |
---|---|---|---|
20110106840 A1 | May 2011 | US |
Number | Date | Country | |
---|---|---|---|
61258462 | Nov 2009 | US |