Systems and methods for providing anonymized user profile data

Information

  • Patent Grant
  • 9595051
  • Patent Number
    9,595,051
  • Date Filed
    Friday, February 20, 2015
    9 years ago
  • Date Issued
    Tuesday, March 14, 2017
    7 years ago
Abstract
Embodiments facilitate confidential and secure sharing of anonymous user profile data to improve the delivery of customized content. Embodiments of the invention provide a data appliance to an entity such as a business to convert profile data about the business's customers into anonymous identifiers. A similar data appliance is provided to a content provider in one embodiment to generate identifiers for its user profile data. Because the anonymous identifiers are generated with the same anonymization method, identical identifiers are likely generated from profile data of the same users. Therefore, the identifiers can be used to anonymously match the customers of the business to the users of the content provider. Therefore, data can be shared to improve customized content such as advertisements that the business wishes to place with the content provider without requiring the business to disclose customer data in an unencrypted form, and any non-matched data can remain confidential.
Description
BACKGROUND

Field


This disclosure relates in general to computer data processing, and in particular to computer based systems and methods for providing anonymized user profile data.


Description of the Related Art


In the online environment, the effective delivery of customized content is dependent on the quality of known data about the intended consumers of such content. For example, the effectiveness of an advertisement (“ad”) is enhanced when it is delivered to a person whose attributes and/or other recorded past actions indicate possible interest in the content of the ad. While user profile data may be used to customize the delivered content, the sharing of such data is hindered by reluctance among entities that hold such data out of competitive and privacy concerns. For example, while an advertiser may benefit from improved ad customization as a result of sharing information about its customers with a content publisher from which it wishes to purchase ads, the advertiser is typically reluctant to share such data.


SUMMARY OF THE DISCLOSURE

Embodiments of the disclosure are directed to computer based systems and methods for sharing user profile data in an anonymized manner. Embodiments facilitate confidential and secure sharing of de-personalized and/or anonymous customer profile data among entities to improve the delivery of customized content. For example, embodiments of the invention provide a data appliance to an entity such as a business to convert profile data about the business's customers into anonymous identifiers. A similar data appliance is provided to a content provider in one embodiment to generate identifiers for its user profile data. A central server connected to the data appliances facilitate the sharing of the anonymous identifiers across data networks. In one embodiment, because the anonymous identifiers are generated with the same anonymization method, identical identifiers are likely generated from profile data of the same users. Therefore, the identifiers can be used to anonymously match the customers of the business to the users of the content provider. As such, the matched data can be shared to improve the delivery of customized content such as advertisements that the business wishes to place with the content provider without requiring the business to disclose customer data in an unencrypted form, and any non-matched data can remain confidential.


One embodiment of the invention is system for anonymously sharing user profile data among a plurality of entities. The system comprises a plurality of data appliances located at a plurality of entities with user profile data and a server configured to communicate with each of the plurality of data appliances to facilitate sharing of user profile data among the plurality of data appliances. The plurality of data appliances further includes a first data appliance that is configured to: receive, from a first entity, first user profile data for a first group of users associated with the first entity, the first user profile data including names and addresses of the first group of users; encrypt the first user profile data for each of the first group of users into a first encrypted identifier; and send the first encrypted identifiers to the server. The plurality of data appliances also includes a second data appliance that is configured to: receive, from a second entity, second user profile data for a second group of users associated with the second entity, the second user profile data including names and addresses of the second group of users; encrypt the second user profile data for each of the second group of users into a second encrypted identifier with the same encryption used by the first data appliance, so that common user profile data between the first and second user profile data are converted into identical encrypted identifiers; receive from the server the first encrypted identifiers; and locate identical identifiers from among the first and second encrypted identifiers to generate an anonymous list of common users between the first and second groups of users, whereby the list can be used to customize content provided by the second entity to the users associated with the first entity.


Another embodiment is a system for anonymously sharing user profile data among a plurality of entities. The system comprises a plurality of data appliances and a server configured to receive data from and transmit data to the plurality of data appliances. The plurality of data appliances comprises a first data appliance that is configured to: receive, from a first entity, first personal identifiable information related to a first group of persons; transform the first personally identifiable information into first encrypted data via an encryption process, the first encrypted data comprising an identifier for each of the first group of persons; and send the encrypted data to the server. The plurality of data appliances also comprises a second data appliance that is configured to: receive, from a second entity, second personally identifiable information related to a second group of persons; transform the second personally identifiable information into second encrypted data with the encryption process used by the first data appliance, the second encrypted data comprising an identifier for each of the second group of persons; receive from the server the first encrypted data; and use the first and second encrypted data to anonymously generate list data related to common persons between the first and second groups of persons, so that the list data can be used to customize information provided by the second entity at a direction of the first entity.


Yet another embodiment is a method for sharing anonymized user profile data. The method comprises: receiving at a first data appliance, first personally identifiable information related to a first group of persons; transforming the first personally identifiable information into first encrypted data via an encryption process, the first encrypted data comprising an identifier for each of the first group of persons; transmitting the first encrypted data from the first encrypted data to a second data appliance; receiving, at the second data appliance, second personally identifiable information related to a second group of persons; transforming the second personally identifiable information into second encrypted data with the encryption process, the second encrypted data comprising an identifier for each of the second group of persons; and using the first and second encrypted data to anonymously generate list data related to common persons between the first and second groups of persons, so that the list data can be used to customize information provided by the second entity at a direction of the first entity.





BRIEF DESCRIPTION OF THE DRAWINGS

Specific embodiments of the invention will now be described with reference to the following drawings, which are intended to illustrate embodiments of the invention, but not limit the invention:



FIG. 1 is a flow diagram illustrating one embodiment of the marketing data sharing architecture;



FIG. 2 is a flow diagram illustrating the process of loading and matching data with the user ID pass-through feature according to one embodiment;



FIG. 3 is a flow diagram illustrating one embodiment of a hybrid real time targeting model;



FIG. 4 is a flow diagram illustrating one embodiment for data sharing with a data partner;



FIG. 5 is a flow diagram illustrating another embodiment for data sharing with a data partner;



FIG. 6 shows an example audience select tool in accordance with one embodiment; and



FIG. 7 is a flow diagram illustrating the use of data sharing to generate customized email marketing in accordance with one embodiment.



FIGS. 8A and 8B show examples of audience reports output by the system in accordance with one embodiment.



FIG. 9 is block diagram of an example computing system of an embodiment.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Embodiments of the invention will now be described with reference to the accompanying figures, wherein like numerals refer to like elements throughout. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of certain specific embodiments of the invention. Furthermore, embodiments of the invention may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the inventions herein described.


System Overview


The effectiveness of online advertising has been shown to improve significantly when an advertisement (“ad”) is customized for a consumer based on known data about that consumer. Ad customization can be performed by either the sellers or buyers of online advertising. Sellers of online advertising include (but may not be limited to) web publishers, portals and ad networks. Buyers of online advertising are advertisers and their agencies. The amount of information that parties have about the consumers they interact with differs based on the type of business they are. An advertiser may have an established database of its customers, both online and offline, that collects information about the consumer's interaction with that advertiser's business. Additionally, an online publisher that requires its users to login to its website as members may have detailed information on each user member. By contrast, an ad network may not have a simple way of collecting customer data other than via observed behaviors.


Regardless of the relative volume of known consumer profile data, for reasons of existing privacy policies and/or for competitive and strategic considerations, companies are traditionally reluctant to share consumer data without the existence of some trusted third party that can protect the confidential information of each contributor. For example, an advertiser A may share a number of common customers with a publisher B. Advertiser A may wish to only target its ads to those common customers on publisher B's website. One way of to achieve this is for A to send B a complete list of its customers and have B match the list against its own member list. However, Advertiser A may be reluctant to share such data with Publisher B for privacy, competitive and strategic reasons. However, if C, a trusted third party, took responsibility for merging the consumer data from Advertiser A and from Publisher B, identifying the overlap, and providing the customization data back to Publisher B in a manner through which consumer identifying information is anonymized, then the parties may be more inclined to use their known data for ad customization. In this manner, A will ensure that B will only know the common users/customers without seeing all of A's customers. If this capability could be made available across a large number of ad sellers, then an advertiser could make highly targeted ad buys across multiple ad sellers.


Embodiments of the invention facilitate confidential and secure sharing of de-personalized and/or anonymous customer profile data between companies for the purposes of improving ad targeting. Companies that would share such data could include buyers of media (e.g., advertiser), sellers of media (e.g., publisher, portal, or ad network), multiple advertisers (in a co-operative type model), or multiple sellers of media. Embodiments of the invention enable an entity to de-personalize and/or anonymize its own consumer data and match that data to a third party's consumer data via anonymous keys. As such, the user profile data can be shared to improve ad customization without the need to disclose sensitive data in an unencrypted form.


Embodiments of the invention comprise a network of marketing data appliances (MDAs) that connect to each other to provide data matches among various entities. The MDAs perform data standardization and encryption to de-personalize the data. An MDA can also use an anonymous key, common to all MDAs to match similar data among MDAs. An entity that wishes to participate in the sharing of data can install the MDA within its secured network environment or can use a central installation. Alternatively, an entity may also share data using MDAs that are hosted off-site via secured transmission channels. The MDAs may be interconnected to one another, as well as to one or more marketing bureaus that serve as hubs that support the anonymization and matching processes performed at the local MDAs. In one or more embodiments, marketing bureaus are data processing entities with computing capacity (computer servers) that can handle matching and anonymization functions. Additional details relating to marketing bureaus will be provided later in the specification.


Embodiments of the data sharing system are beneficial in several ways. First, they enable media buyers to target against their own criteria instead of or complementary to the media's available criteria, thereby reducing media waste and increasing the precision and response of their advertising. Second, they enable media buyers to focus their media purchases without the need to disclose confidential user profile data about their customers. Third, the various embodiments create a virtual network that links disparate entities with potentially different data formats and provides a standardized way to exchange ad targeting and/or other relevant data. Finally, the various embodiments create a dynamic data accounting method that enables both media buyers and sellers to instantly view the number of targeted users at various publisher or portal sites through the use of an audience selector tool.


Although this disclosure provides example embodiments for Internet or online advertising, embodiments of the invention are not so limited to those environments. For example, embodiments of the invention can be implemented in any environment with addressable devices. For example, embodiments may be used to target advertisements served to wireless devices such as cell phones and PDAs, cable television and satellite TV set top boxes, gaming consoles, and other portable devices such as music players and electronic book readers. Embodiments of the invention may be used in numerous environments, even those without “addressable” systems or those in “non-digital” media. Embodiments can be used in non-digital environments such that anonymized marketing data can be used to conduct, for example, phone or postal mail advertising campaigns. This is because, in addition to real-time request/response handling for ad and/or content customization, some embodiments provide productionized and efficient merge, purge, and data enhancement capabilities that can function in “batch” mode of operations, which can be performed daily/nightly/weekly or incrementally (every n hours).


System Architecture and Process



FIG. 1 depicts the components of the data sharing architecture. Although a marketing bureau 102 is shown as connecting an advertiser 104 to a portal or publisher 106, in FIG. 1, the marketing bureau 102 can connect other entities shown in the figure as well. The advertiser 104 and the portal or publisher 106 are highlighted in FIG. 1 as examples. As shown, the advertiser 104 has a member database 114 and the portal or publisher 106 has its own member database 116 as well.


Anonymization of User Profile Data Provided by Advertisers


In one embodiment, to enable anonymized data sharing through the marketing bureau 102, the advertiser 104 installs a MDA 108 within its own environment, which may be protected by a network firewall. The bureau 102 may host a computer server that acts as a central repository for all information about each participating entity's address market. The information may include market segment data, for example. As described below, the data sharing architecture includes a network of interconnected MDAs that enable all connected entities to share data. The anonymized sharing and data matching process proceeds as follows. In step 1, the advertiser 104 may upload, from its member database 114, any (1) personally identifiable information (PII) data such as member names, postal addresses, and (2) additional data such as segments onto the MDA 108. The uploaded data will be referred to as marketing data in this disclosure, and marketing data may include other non-PII data such as IP addresses, email addresses, cookie IDs, etc. In other embodiments, the PII may include email addresses, user IDs, social security numbers, IP addresses, phone numbers, etc. As used herein, “profile data,” “customer data,” and “consumer data” are used to refer generally to both PII and marketing data.


In step 2, as these records are being uploaded, the MDA 108 may derive bureau IDs (BIDs) by encrypting, through for example a forward encrypting hash algorithm such as SHA, some or all of the member's PII, e.g., name and postal address information. In another embodiment, a proprietary hash algorithm is used. For example, a name “John Doe” and an address “123 Main St.” may be hashed into a resultant BID string “A348BEF6” so that the name and address cannot be deciphered from reading the resultant string. Once the BIDs are derived, the encryption process then purges the uploaded names, postal addresses, and other PII data. Because in various embodiments the encryption hashing algorithm is not data dependent, matching may be performed on other member/customer profile data such as membership IDs, vehicle IDs, cookie IDs, phone numbers, and/or email addresses. Any of the identifiable information that is used as input for the match, like a cookie ID or an email address, is subsequently converted into a BID. In one embodiment, if only name and ZIP code are provided, the MDA 108 first attempts to locate the complete postal address using the name and ZIP code and then performs the hashing process.


In one embodiment, the encryption process of step 2 takes place while the uploaded marketing data records are still in volatile memory such as in the MDA's random access memory (RAM). As such, sensitive records containing PII such as names and addresses are not placed in long term storage of the MDA. In one embodiment, the MDA does not need to use the full set of marketing segment data from the marketing bureau server in the encryption process.


After the encryption processing has completed, the MDA 108 stores records that include BIDs and the advertiser appended custom segment data and/or generic segment data appended by the MDA. For example, if the advertiser 104 were a credit reporting agency, it might append custom segment data that indicates whether a consumer is a free trial, paid, or cancelled member of its credit reporting subscription service. Also, the MDA 108 may append generic marketing data (segments) from other sources. The appended marketing segment data may be selected by the advertiser. For example, while an advertiser may not have its own custom segment data, it may instruct the MDA to append segment data identifying “New Parents” or “New Homeowners.” The MDA 108 may use a localized copy of marketing segment data that is periodically updated by a remote server. The localized copy may be encrypted.


If any of the advertiser's appended data is deemed sensitive, the MDA 108 may apply additional security hashing to the appended data to provide a further tier of protection. The MDA may be configured so that no personally identifiable information (PII) is passed outside of the advertiser's environment.


In step 3, in one embodiment, the now anonymized advertiser's segment data is then propagated, through the marketing bureau 102, to some or all of participating entities that are connected to the data sharing network, including the publisher, portal, or ad network from which the example advertiser may wish to buy media. In one embodiment, steps 1-3 as described above may be performed as part of a nightly batch processing job. However, one or more the steps may be performed in real time or as part of a batch job executed at different intervals (e.g. weekly). Once the initial matching and propagation steps are accomplished upon an entity joining the data sharing network, subsequent matching and propagation may be performed on a smaller subset profile data within the member database that includes recent changes.


Embodiments of the invention also allow advertisers to identify some or all of its uploaded marketing data as the ideal or targeted modeling criteria for expanded or “look-alike” matching. For example, an advertiser may specify that ZIP codes be used as an expanded matching criterion, so that the matching process performed by the MDA located at the publisher, portal and/or ad network as further described below returns matching results with additional persons who may live in or near the ZIP code areas of those consumers identified within the advertiser's data. Similarly, an advertiser may select one or more segments on which an expanded matching may be performed (e.g. matching on a “New Parents” or “New Homeowners” segment). In one embodiment, the look-alike matching uses demographic and consumer attributes (e.g. age, gender, income, purchase preferences, etc.) to identify additional persons who are similar to those in the matched results.


In one embodiment or more embodiments, an advertiser can identify ideal or targeted criteria through one of two methods. First, an advertiser can identify ideal or targeted criteria by inserting data flags into the uploaded marketing data records as part of the upload process described above. The uploaded data records may be termed a “primary list” in one or more embodiments. Second, an advertiser can provide a secondary list in conjunction with the primary list, with the secondary list providing a list of records on the primary list that have the ideal or targeted criteria.


Anonymization of User Profile Data Provided by Publishers and Portals


In one embodiment, similar to the advertisers, publishers and portals also install MDAs locally and possibly within their firewalls. In one embodiment, similar to steps 1-3, the portal or publisher 106 undertakes step 4 to upload its subscriber or member file onto an MDA 110 and in step 5 a similar encryption process takes place within MDA 110. The subscriber or member file may include marketing data, which may include PII data and other additional data such as segment data. In one embodiment, a forward encrypting hash algorithm (e.g., SHA) is applied to some or all of the subscriber's or member's PII, e.g., name and postal address information, to derive BIDs. Using the example from above, a “Joe Doe” at “123 Main St.” may be hashed into a resultant BID string “A348BEF6,” which, as described below, is used to match the BID previously generated at the advertiser's MDA. In other embodiments, the PII may include email addresses, user IDs, social security numbers, IP addresses, phone numbers, etc. In one embodiment, if only name and ZIP code are provided, the MDA 110 first attempts to locate the complete postal address using the name and ZIP code and then performs the hashing process. In one embodiment, the derived BIDs replace the names and postal addresses in RAM, ensuring that no names, postal addresses or other PII are stored in non-volatile memory storage. The MDA 110 may include a localized copy of marketing segment data that is periodically updated by a remote server. The localized copy may be encrypted.


Joining/Matching User Profile Data


In step 6, the BID is then used as the connecting key between the disparate data sets from the advertiser 104's member and segment data and those of the portal or publisher 106. In particular, the MDA 110 of the portal or publisher 106 uses the BIDs to join or match the incoming data (from the advertiser 104) with those from the member database 116 of the portal or publisher 106. Although not shown in FIG. 1, the same BID match process can be used to match data between an advertiser and an ad network as well. In one embodiment, once the matching ends, the BIDs are purged, leaving the publisher, portal or ad network's own identifier for a particular consumer and the advertiser's client segment for that same consumer. Thus, the matching is done such a way any non-matched data of the advertiser remains confidential and not revealed to the publisher or portal.


After the processing has completed, the MDA 116 contains records that include BIDs and user IDs from the publisher or portal 106 and ad segment. This creates a set of valid BID to user ID mappings for the network. In one embodiment, the BIDs are then purged, leaving only the publisher, portal or ad network's own identifier for a particular consumer (e.g., user ID) and the advertiser's segment for that same consumer. In step 7, the portal or publisher 106 may then export the list of joined user IDs and the corresponding advertiser's segment data to its proprietary ad server 120 or to an outsourced ad sever. Alternatively, as shown later in FIG. 3, the joined user IDs and the corresponding advertiser's segment data may be retrieved in real time through the use of a compute cluster.


With the data matching completed, advertisers can then include or exclude their own member households or otherwise target their own data in their media buys with publishers or portals. The process may proceed as follows. The advertiser 104 may place a media buy insertion order with the portal or publisher 106. The portal or publisher 106 may possibly stipulate to not target existing members of the advertiser 104. The portal or publisher 106 may then export a list from its local MDA 110, comprised of only its own members that are also known members of the advertiser 104, and upload the list onto its ad server as an “exclusion target” for a campaign, where segment(s) of customers/members are excluded from a media campaign (e.g. existing customers/members are excluded).


The MDAs make up a distributed network that facilitates businesses' ability to connect with each other's data in real time or batch mode and in a secure manner that de-personalizes consumer information throughout the processing steps. While FIG. 1 depicts a data flow from an advertiser to a portal/publisher, embodiments of the invention can facilitate data sharing between any entity depicted, e.g., between two advertisers, between two ad networks, or between two publishers/portals.


In one embodiment, MDA ensures that any set of data elements does not constitute a signature. This means that, for example, any set of data elements must be the same for at least 100 users or 0.05% of the users, whichever is greater. In one embodiment, if a data element set has less than 100 users, that element is not created so as to protect the privacy of the few users that may constitute that element.


In one embodiment, the matching process takes into account the generic or custom segment data and/or expanded matching criteria. Thus for example, before or after identifying the overlap in users/members/subscribers between the advertiser and the publisher/portal, the matching process may apply criteria to narrow or expand the match results. The matching process may narrow by filtering the results through segment matching. For example, the results may be narrowed down to include those records with matching segments only. As discussed above, the segments may be custom (created by the advertisers) or generic (selected by the advertisers from a list of available segments). The matching process may also expand the overlap results by using expanded or “look-alike” matching as previously described. In these embodiments, the matching process adds to the overlap list users/members/subscribers of the publisher or portal that do not already appear on the overlap list but nonetheless match one or more ideal or targeted criteria as specified by the advertiser. In one or more embodiments, the system is highly customizable and the advertiser can select a combination of narrowing or expanding matching processes as described above.


Ad Network


Although ad networks sell media to advertisers across publisher websites with their networks and have large ad distribution capability, they generally have very limited or no PII such as names or postal addresses for their “members,” which in this case include households or users that are tracked by the ad networks. Instead, for each end user, ad networks generally create a unique user ID that they store locally and in cookies on the end user's computer. Cookies are small text files that are deposited onto consumers' computers and generally contain basic identifying information such as user IDs, time stamps, etc.


One embodiment directed at the ad network model takes into account information that the ad networks may pass back to advertisers. In addition to the process described above in conjunction with FIG. 1, this embodiment allows for the ad network to pass its user ID to back to the advertiser when an end user clicks on the advertiser's ad.



FIG. 2 illustrates this additional user ID pass-through feature. User ID matching steps 1-6 are substantially similar to the corresponding steps illustrated in FIG. 1. After they are completed, the advertiser 104 may arrange for the ad network 124 to pass its user ID to the advertiser 104 in the “E” series of steps shown in FIG. 2. The user ID may be passed via a cookie or other suitable means. In step E1, the advertiser 104 places an insertion order for a media buy with the ad network 124. In step E2, the ad network exports a list of user IDs with the advertiser's segments to a publisher-partner site 124. In step E3, when a visitor clicks on an ad served by on the publisher-partner site 124, the visitor is re-directed to the advertiser's site 126. During the re-direction, the advertiser 104 receives the ad network's user ID for that visitor. In step E4, the user ID is carried through to the visitor's session with the advertiser, which may end with a registration or lead form 130 for service sign up. Assuming the visitor completes the registration or lead form 130, the advertiser 104 receives his or her marketing data including PII, e.g., name and postal address, and in step E5 passes the newly received marketing data to its local MDA 108.


In one embodiment, in the MDA 108 the above described anonymization process would be executed the newly received marketing data. In one embodiment, after the anonymization processing is executed in the MDA's RAM, the MDA may contain a BID, the advertiser's segments, and the ad network's user ID. In step E6, this newly processed information is passed through the marketing bureau to the ad network 124, so that it can be joined, in the ad network's local MDA, with a forward hashed version of the ad network's user ID. After the new data match in step E6, the ad network would have the ability to connect its user IDs with the advertiser's segments.


The “F” series of steps illustrate an alternate embodiment in which the advertiser is using the data sharing system to target specific segments on the publisher-partner site 126 using data obtained in the “E” series of steps. In step F1, the advertiser 104 may place a media buy with the ad network 124, targeting its members with, for example, upsell offers. In step F2, the ad network 124 may export a list of its IDs and the advertiser's members that are the targets for upselling, and upload the list to the ad server for the publisher-partner site 126. When users who are members of the advertiser 104 visit the publisher-partner site 126, they may see ads that are targeted to them for upselling, leading them to the advertiser's site 128.


Data Transmission


In one embodiment, data that are transmitted from the advertiser to the publisher or portal are fully encrypted. These data may be passed using an encryption scheme such as GPG (GnuPG) and the keys to decrypt the data exist on the target MDAs. For example, in FIG. 1, the decryption keys reside on MDA 110. Servers that receive the data in transit do not have the keys required to decrypt the data and act as a pass-throughs to minimize the amount of firewall rules required to accommodate MDAs that receive the data.


Hybrid Real Time Targeting Model


In one embodiment, a publisher, portal, or an ad network may have a compute cluster 138 installed within its environment in addition to a MDA. An example embodiment with a compute cluster 138 is illustrated in FIG. 3. BID matching steps 1-6 shown in FIG. 3 are substantially the same as the corresponding numbered steps depicted in FIG. 1. However, instead of a simple export to the ad server in step 7, a different process is performed on a per-transaction basis as illustrated in the following “G” series of steps depicted in FIG. 3.


In step G1, the advertiser 104 may place a media buy with the portal or publisher 106. In step G2, when a user visits the portal or publisher site 106, the portal or publisher 106 may send a request to the compute cluster 138 with the user ID that the publisher 106 has assigned to the user, along with the user's IP address. If the compute cluster 138 fails to find a match on the user ID, it may send the IP address to the marketing bureau and retrieve household level targeting or inferred geo-demographic targeting of consumer data. The process of obtaining inferred geo-demographic targeting is further described in co-pending U.S. patent application entitled “SYSTEMS AND METHODS FOR REAL TIME SEGMENTATION OF CONSUMERS,” Ser. No. 12/118,585, filed May 9, 2008, the disclosures of which are hereby fully incorporated by reference. Once the appropriate targeting data is returned to the ad server 120, an ad may be selected based on the targeting data and served in step G3.


With the compute cluster, any publisher, portal, or ad network can offer three tiers of insights to its advertisers, namely by custom segment (FIG. 1), by household level targeting data (e.g., through segment data made available by the compute cluster), and by inferred geo-demographic targeting data (e.g., through functions provided by the compute cluster) (FIG. 3). Having a compute cluster also allows the publisher, portal, or ad network to retrieve advertiser targeting on a transaction-by-transaction basis, rather than exporting a file from its MDA to its ad server.


Localized Copy of Marketing Segment Database


As mentioned above, in some embodiments, each MDA can include a local encrypted copy of a marketing segment database. Thus, in addition to submitting marketing data including PII such as names and addresses from their membership databases, advertisers could then also retrieve the cleansed records (e.g., hygiene—cleanse invalid records, standardization—standardize data elements such as address suffix, and verification—verify the data elements with an external source) along with data enhancement and even custom scores in real time, within their own local environments. For example, the MDA may contain a local copy of segment market data that may be returned as part of the data anonymization process. Similarly, the MDA may perform a process of standardizing the input addresses and may return addresses that conform to U.S. Postal standards, for example. In some embodiments, custom scores may also be returned as part of the process. The functions and features of an individual compute cluster are customizable and may be dynamically updated through data sent from the marketing bureau 102.


Data Partners



FIG. 4 illustrates another embodiment where a data partner 142 is involved in the process. In this embodiment, an advertiser 162 places ads on a publisher 152 while using the data partner 142's segment data to target the ads. The BID matching steps 1-6 shown in FIG. 4 are substantially the same as the corresponding numbered steps depicted in FIG. 1, except in FIG. 4 the matching is conducted between members of the data partner 142 and the publisher 152.


Once the matching steps are accomplished, the process proceeds as illustrated in the “H” series of steps in one embodiment. In step H1, the advertiser 162 places a media buy insertion order with the publisher 152, instructing it to target the data partner 142's members. In step H2, the publisher 152 exports a list from its local MDA 154, comprised of only user IDs from the publisher's member database 156 that are known members of data partner 142, and uploads the list onto its ad server 160 as the target for a campaign for the advertiser 162 on its site. In step H3, acquisition marketing traffic from the display of those targeted ads is driven to the advertiser 162.



FIG. 5 illustrates another example embodiment that connects an advertiser and a data partner 172 to an ad network 182. In this embodiment, an advertiser and data partner 172 places ads on an ad network 182. The BID matching steps 1-6 shown in FIG. 5 are substantially the same as the corresponding numbered steps depicted in FIG. 1. Note that the ad network 182 is able to accomplish the matching steps for the advertiser and data partner 172 because it has access to member data. Some ad networks may not have PII data such as name and address data on which they can conduct the initial BID matching.


Once the matching steps are accomplished, the process proceeds as illustrated in the “I” series of steps in one embodiment. In step 11, the advertiser 172 places a media buy insertion order with the ad network 182, instructing it to target a specific segment of the advertiser and data partner 172's members. In step 13, the ad network 182 exports a list from its local MDA 184, comprised of user IDs from the advertiser and data partner's member database 176, and uploads the list onto its ad server 190. In step 13, acquisition marketing traffic from the display of those targeted ads are driven to the advertiser and data partner 172.


Customized Emails



FIG. 6 illustrates another embodiment in which the data sharing system is applied to provide targeted advertising through customized emails. In this embodiment, a customized email provider 192 purchases ads from an portal/publisher 196 that will be placed into the email provider 192's own emails instead of web pages. The segments used in this matching process are provided by an advertiser A1194 that wishes to use the email provider 192 to send custom emails on A1's behalf. The BID matching steps 1-6 shown in FIG. 7 are substantially the same as the corresponding numbered steps depicted in FIG. 1. In step 7, matched data from the portal/publisher 196 are exported to a server that sends customized ads to emails generated by the email provider 192.


Audience Selector Tool


With a network of MDAs installed in various advertisers, ad networks, publishers and online portals and interconnected through the marketing bureau, sharing of user profile data may be greatly enhanced and online media buys may be made more efficient. In addition, advertisers may be able to query, through an audience selector tool, the data sharing system to determine how many unique users exist within the desired target entities. For example, an ad buyer may be able to see how many unique users exist on various portal and/or publisher sites that are also free trial members of its services. An example audience selector tool is shown in FIG. 7.


Feedback Data—Match Data and Conversion Metrics


In addition to the audience selector tool, which can assist in pre-purchase planning and allocating decisions, embodiments also provide feedback data to assist advertisers and other participants to monitoring match rates and return on investment. In one or more embodiments, an advertiser can receive feedback on the marketing data uploaded. The feedback data provided by embodiments of the MDA include the number of persons within the uploaded data who match certain segments. FIG. 8A provides an example of the type of match data provided. As shown, an example advertiser is receiving a report on the number of matches with a publisher and the detailed breakdown of matches by segments.


In one or more embodiments, the feedback data provided is based on conversion metrics. To receive conversion metrics data, an advertiser can identify a number of persons who have recently engaged in conversion activities. For example, an advertiser can identify persons who have recently signed up for paid services or filled out a form to request additional information as a result of its advertising efforts initiated through the system. An advertiser may identify such persons through, for example, the two mechanisms described in conjunction with FIG. 1: (1) upload a secondary list of such persons or (2) identify such persons in the primary list by, for example, inserting flags into the data records. The MDA in one or more embodiments processes the uploaded information by cross-referencing it against the primary list(s) uploaded from previous time period(s) and returning an estimated percentage of conversion to the advertiser.


For example, a MDA may receive from an advertiser a list of persons who have engaged in conversion activities in the last week. The DNA may cross reference the new conversion list against the primary list from last week's campaign and return one or more example conversion metrics as shown in FIG. 8B. As shown in the figure, the metrics calculated include a tally of those who visited the site, those who signed up for trial services and those who signed up for paid services. As shown, the metrics results may also include break-down by segments for individual conversion activities. The metrics on conversion activities are customizable and can be used to track any type of activities. For example, when used in contexts outside of internet advertising, a cable television operator may track movie downloads and a wireless service provider may track ringtone or song downloads. Metrics calculations can also be performed at various frequencies, for example, on a real-time or near real-time, daily, weekly, monthly, or yearly basis. The MDA in one embodiment aggregates the metrics over a period of time and provides advertisers a reporting tool for analyzing their return on investment in their advertising efforts.


As mentioned above, the various types of match and feedback data reports provided can be customized by advertisers and/or other interested parties. Similarly, portals, publishers and ad networks may be able to customize such reports and utilize them to provide potential advertisers characteristics of its membership. In addition, advertisers, portals, publishers and ad networks may use the match and feedback data to fine tune matching criteria in expanded (“look-alike”) matching operations as described above.


System Architecture



FIG. 9 is a block diagram illustrating a computer system 200 for implementing the marketing data appliances, bureau servers, ad servers, compute clusters, and other computer systems and devices illustrated in FIGS. 1 to 6 in accordance with one embodiment. The computer system 200 includes, for example, a personal computer that is IBM, Macintosh, or Linux/Unix compatible. In one embodiment, the computing system 200 comprises a server, a desktop computer, a laptop computer, a personal digital assistant, a kiosk, or a mobile device, for example. In one embodiment, the computing system 200 includes a central processing unit (“CPU”) 202, which may include one or more conventional microprocessors. The computing system 200 further includes a memory 206, such as random access memory (“RAM”) for temporary storage of information and a read only memory (“ROM”) for permanent storage of information, and a mass storage device 210, such as a hard drive, diskette, or optical media storage device. Typically, the components and modules of the computing system 200 are connected to the computer using a standard based bus system 208. In different embodiments, the standard based bus system could be Peripheral Component Interconnect (“PCI”), Microchannel, Small Computer System Interface (“SCSI”), Industrial Standard Architecture (“ISA”) and Extended ISA (“EISA”) architectures, for example. In addition, the functionality provided for in the components and modules of the computing system may be combined into fewer components and modules or further separated into additional components and modules.


The computing system 200 is generally controlled and coordinated by operating system software, such as Windows Server, Linux Server, Windows XP, Windows Vista, Unix, Linux, SunOS, Solaris, or other compatible server or desktop operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In other embodiments, the computing system 200 may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface, such as a graphical user interface (“GUI”), among other things.


The computing system 200 includes one or more commonly available input/output (I/O) devices and interfaces 216, such as a keyboard, mouse, touchpad, and printer. In one embodiment, the I/O devices and interfaces 216 include one or more display device, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, and multimedia presentations, for example. The computing system 200 may also include one or more multimedia devices 204, such as speakers, video cards, graphics accelerators, and microphones, for example. In other embodiments, such as when the computing system 200 comprises a network server, for example, the computing system may not include any of the above-noted man-machine I/O devices.


In the embodiment of FIG. 9, the I/O devices and interfaces 216 provide a communication interface to various external devices. In the embodiment of FIG. 9, the computing system 200 is electronically coupled to the network 214, which may comprise one or more of a LAN, WAN, or the Internet, for example, via a wired, wireless, or combination of wired and wireless, communication link 212. The network 214 facilitates communications among various computing devices and/or other electronic devices via wired or wireless communication links.


According to FIGS. 1 to 6, requests are sent to the computing system 200 over the network 214. Similarly, results are returned over the network 214. In addition to the devices that are illustrated in FIG. 9, the computing system 200 may communicate with other data sources or other computing devices. In addition, the data sources may include one or more internal and/or external data sources. In some embodiments, one or more of the databases, data repositories, or data sources may be implemented using a relational database, such as Sybase, Oracle, CodeBase and Microsoft® SQL Server as well as other types of databases such as, for example, a flat file database, an entity-relationship database, and object-oriented database, and/or a record-based database. For example, the above described data including at least the user profile data, the member data, the customer data, the personally identifiable information, and the encrypted data may be stored in various embodiments in these data sources.


In the embodiment of FIG. 9, the computing system 200 also includes program codes and/or instructions stored on the mass storage device 210 that may be executed by the CPU 202. The program codes and/or instructions may include modules for performing user profile data anonymization, hashing, data encryption, data matching, and audience reporting as described above. These modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. Alternately, the modules may be implemented as separate devices, such as computer servers.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software instructions may be embedded in firmware. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


CONCLUSION

The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention can be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.

Claims
  • 1. A system for sharing consumer data among a plurality of entities, comprising: one or more computing devices configured to execute instructions that instruct the one or more computing devices to at least: receive, at a central marketing bureau system comprising one or more computing devices, first encrypted data from a first entity for a group of individuals and second encrypted data from a second entity for the group of individuals, wherein each respective individual in the group of individuals is associated with at least the first entity and the second entity,wherein the first encrypted data and the second encrypted data are encrypted using a forward encrypting hash algorithm to transform personally identifiable information associated with respective individuals of the group of individuals into anonymous identifiers associated with the respective individuals, wherein encryption of the first encrypted data and the second encrypted data occurs while the personally identifiable information is in volatile memory;append supplemental market segment data with the first encrypted data from the first entity and the second encrypted data from the second entity, wherein the respective individuals are associated with one or more market segments of the supplemental market segment data; andperiodically transmit the appended market segment data, including the first encrypted data from the first entity and the second encrypted data from the second entity, to the first entity,wherein the first entity implements a first data appliance configured to generate an anonymized list of individuals based on matching of the appended market segment data to data associated with the group of individuals stored by the first entity, wherein the anonymized list is used to customize content provided by the first entity to one or more of the group of individuals.
  • 2. The system of claim 1, wherein the forward encrypting hash algorithm is a secure hash algorithm (“SHA”) or a proprietary hash algorithm.
  • 3. The system of claim 1, wherein the first data appliance is configured to identify additional individuals referenced in the first encrypted data matching a criterion specified in the supplemental market segment data, wherein the additional individuals were not among the individuals on the anonymized list.
  • 4. The system of claim 1, wherein to generate the anonymized list, the first data appliance is further configured to (1) encrypt personally identifiable information associated with an individual in order to generate a hash for the individual, and (2) match the hash to a record in the supplemental market segment data.
  • 5. The system of claim 1, wherein the supplemental market segment data further comprises matching criteria, and wherein at least some of the individuals on the anonymized list are identified based at least in part on the matching criteria.
  • 6. The system of claim 1, wherein the first data appliance encrypts the personally identifiable information associated with respective individuals using a particular encryption technique, and wherein the second data appliance uses the same particular encryption technique.
  • 7. The system of claim 1, wherein the first entity is a content publisher and the second entity is an advertiser.
  • 8. The system of claim 1, wherein the instructions further instruct the one or more computing devices to transmit the supplemental market segment data, including the first encrypted data from the first entity and the second encrypted data from the second entity, to a third entity different from the first entity and the second entity.
  • 9. A computer-implemented method comprising: receiving, at a central marketing bureau system comprising one or more computing devices, encrypted data for respective groups of individuals each associated with one or more of a plurality of third party entities, the encrypted data being encrypted to transform and anonymize personally identifiable information associated with the individuals;for respective individuals, supplementing market segment data with the encrypted data from the third party entities; andperiodically transmitting the market segment data, including the encrypted data from each of the plurality of third party entities, to each of the plurality of third party entities,wherein each of the plurality of third party entities implements a respective data appliance configured to use the market segment data to access an anonymized list of individuals, wherein the anonymized list is used to customize information provided by the respective entity, and wherein to generate the anonymized list, each respective data appliance is further configured to (1) encrypt personally identifiable information associated with an individual in order to generate a hash for the individual, and (2) match the hash to a record in the market segment data.
  • 10. The computer-implemented method of claim 9, wherein the market segment data further comprises matching criteria, and wherein at least some of the individuals on the anonymized list are identified based at least in part on the matching criteria.
  • 11. The computer-implemented method of claim 9, wherein each respective data appliance encrypts the personally identifiable information associated with respective individuals using a particular encryption technique, and wherein each respective data appliance uses the same particular encryption technique.
  • 12. The computer-implemented method of claim 9, wherein at least one third party entity is a content publisher and at least another third party entity is an advertiser.
  • 13. The computer-implemented method of claim 9, wherein the personally identifiable information comprises names and addresses associated with the plurality of individuals.
  • 14. A computer-implemented method comprising: receiving, at a central marketing bureau system comprising one or more computing devices, encrypted data for respective groups of individuals each associated with one or more of a plurality of third party entities, the encrypted data being encrypted to transform and anonymize personally identifiable information associated with the individuals;for respective individuals, supplementing market segment data with the encrypted data from the third party entities; andperiodically transmitting the market segment data, including the encrypted data from each of the plurality of third party entities, to each of the plurality of third party entities,wherein each of the plurality of third party entities implements a respective data appliance configured to use the market segment data to access an anonymized list of individuals, wherein the anonymized list is used to customize information provided by the respective entity, and wherein each respective data appliance is configured to identify additional individuals referenced in the encrypted data matching a criterion specified in the market segment data, wherein the additional individuals were not among the individuals on the anonymized list.
  • 15. The computer-implemented method of claim 14, wherein the criterion is residing within an area with a common postal code.
  • 16. A system for sharing consumer data among a plurality of entities, comprising: one or more computing devices configured to execute software instructions in order to: periodically distribute a market segment data structure to each of a plurality of third party entities, wherein the market segment data structure comprises a plurality of unique consumer identifiers for a corresponding plurality of consumers, including consumers associated with each of the plurality of third party entities;wherein each particular third party entity is configured to retrieve data from a copy of the market segment data structure associated with the particular third party entity in order to obtain information regarding consumers associated with the particular third party entity, and wherein to generate the anonymized list, each respective data appliance is further configured to (1) encrypt personally identifiable information associated with an individual in order to generate a hash for the individual, and (2) match the hash to a record in the market segment data.
  • 17. The system of claim 16, wherein at least one third party entity is a content publisher and at least another third party entity is an advertiser.
  • 18. A system for sharing consumer data among a plurality of entities, comprising: one or more computing devices configured to execute software instructions in order to: periodically distribute a market segment data structure to each of a plurality of third party entities, wherein the market segment data structure comprises a plurality of unique consumer identifiers for a corresponding plurality of consumers, including consumers associated with each of the plurality of third party entities;wherein each particular third party entity is configured to retrieve data from a copy of the market segment data structure associated with the particular third party entity in order to obtain information regarding consumers associated with the particular third party entity, and wherein to retrieve data from the copy of the market segment data structure each particular third party entity is configured to:encrypt personally identifiable information associated with a consumer in order to generate a hash for the consumer; andmatch the hash to a record in the market segment data structure.
  • 19. The system of claim 18, wherein each particular third party entity encrypts the personally identifiable information associated the consumer using a particular encryption technique, and wherein each respective third party entity uses the same particular encryption technique.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to, and is a continuation of, U.S. application Ser. No. 14/162,498 filed Jan. 23, 2014, soon to be issued as U.S. Pat. No. 8,966,649, which claims priority to, and is a continuation of, U.S. application Ser. No. 12/777,998 filed May 11, 2010, soon to be issued as U.S. Pat. No. 8,639,920, which claims the benefit of priority from U.S. Provisional Patent Application No. 61/177,205 filed on May 11, 2009, entitled “Systems and Methods for Providing Anonymized Marketing Information,” the entire contents of which are hereby incorporated herein by reference in their entirety. All publications and patent applications mentioned in this specification are herein incorporated by reference in their entirety to the same extent as if each individual publication or patent application was specifically and individually indicated to be incorporated by reference.

US Referenced Citations (894)
Number Name Date Kind
4774664 Campbell et al. Sep 1988 A
4775935 Yourick Oct 1988 A
4982346 Girouard et al. Jan 1991 A
5201010 Deaton et al. Apr 1993 A
5274547 Zoffel et al. Dec 1993 A
5283731 Lalonde et al. Feb 1994 A
5305195 Murphy Apr 1994 A
5325509 Lautzenheiser Jun 1994 A
5454030 de Oliveira et al. Sep 1995 A
5459306 Stein et al. Oct 1995 A
5504675 Cragun et al. Apr 1996 A
5515098 Carles May 1996 A
5560008 Johnson et al. Sep 1996 A
5563783 Stolfo et al. Oct 1996 A
5590038 Pitroda Dec 1996 A
5592560 Deaton et al. Jan 1997 A
5627973 Armstrong et al. May 1997 A
5629982 Micali May 1997 A
5630127 Moore et al. May 1997 A
5640577 Scharmer Jun 1997 A
5649114 Deaton et al. Jul 1997 A
5659731 Gustafson Aug 1997 A
5661516 Carles Aug 1997 A
5692107 Simoudis et al. Nov 1997 A
5696898 Baker et al. Dec 1997 A
5696907 Tom Dec 1997 A
5717923 Dedrick Feb 1998 A
5724521 Dedrick Mar 1998 A
5739512 Tognazzini Apr 1998 A
5740549 Reilly et al. Apr 1998 A
5745654 Titan Apr 1998 A
5745694 Egawa et al. Apr 1998 A
5748098 Grace May 1998 A
5754939 Herz et al. May 1998 A
5774868 Cragun et al. Jun 1998 A
5774870 Storey Jun 1998 A
5819092 Ferguson et al. Oct 1998 A
5819226 Gopinathan et al. Oct 1998 A
5822750 Jou et al. Oct 1998 A
5822751 Gray et al. Oct 1998 A
5825884 Zdepski et al. Oct 1998 A
5828837 Eikland Oct 1998 A
5832068 Smith Nov 1998 A
5844218 Kawan et al. Dec 1998 A
5848396 Gerace Dec 1998 A
5857175 Day et al. Jan 1999 A
5864822 Baker, III Jan 1999 A
5870721 Norris Feb 1999 A
5873068 Beaumont et al. Feb 1999 A
5881131 Farris et al. Mar 1999 A
5889799 Grossman et al. Mar 1999 A
5889958 Willens Mar 1999 A
5907608 Shaffer et al. May 1999 A
5912839 Ovshinsky et al. Jun 1999 A
5915243 Smolen Jun 1999 A
5924082 Silverman et al. Jul 1999 A
5930764 Melchione et al. Jul 1999 A
5930776 Dykstra et al. Jul 1999 A
5933813 Teicher et al. Aug 1999 A
5944790 Levy Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5950179 Buchanan et al. Sep 1999 A
5953707 Huang et al. Sep 1999 A
5956693 Geerlings Sep 1999 A
5961593 Gabber et al. Oct 1999 A
5966695 Melchione et al. Oct 1999 A
5974396 Anderson et al. Oct 1999 A
5991735 Gerace Nov 1999 A
6014688 Venkatraman et al. Jan 2000 A
6026368 Brown et al. Feb 2000 A
6029139 Cunningham et al. Feb 2000 A
6038551 Barlow et al. Mar 2000 A
6044357 Garg Mar 2000 A
6061658 Chou et al. May 2000 A
6061691 Fox May 2000 A
6064973 Smith et al. May 2000 A
6070142 McDonough et al. May 2000 A
6070147 Harms et al. May 2000 A
6073106 Rozen et al. Jun 2000 A
6073140 Morgan et al. Jun 2000 A
6085169 Walker et al. Jul 2000 A
6101486 Roberts et al. Aug 2000 A
6115693 McDonough et al. Sep 2000 A
6119103 Basch et al. Sep 2000 A
6128602 Northington et al. Oct 2000 A
6144948 Walker et al. Nov 2000 A
6157927 Schaefer et al. Dec 2000 A
6178442 Yamazaki Jan 2001 B1
6202053 Christiansen et al. Mar 2001 B1
6208979 Sinclair Mar 2001 B1
6209033 Datta et al. Mar 2001 B1
6223171 Chaudhuri et al. Apr 2001 B1
6233566 Levine et al. May 2001 B1
6236977 Verba et al. May 2001 B1
6253202 Gilmour Jun 2001 B1
6289318 Barber Sep 2001 B1
6298330 Gardenswartz et al. Oct 2001 B1
6304860 Martin et al. Oct 2001 B1
6308210 Fields et al. Oct 2001 B1
6317752 Lee et al. Nov 2001 B1
6324566 Himmel et al. Nov 2001 B1
6330546 Gopinathan et al. Dec 2001 B1
6334110 Walter et al. Dec 2001 B1
6366903 Agrawal et al. Apr 2002 B1
6385592 Angles et al. May 2002 B1
6385594 Lebda et al. May 2002 B1
6405173 Honarvar Jun 2002 B1
6412012 Bieganski et al. Jun 2002 B1
6424956 Werbos Jul 2002 B1
6442577 Britton et al. Aug 2002 B1
6446200 Ball et al. Sep 2002 B1
6456979 Flagg Sep 2002 B1
6457012 Jatkowski Sep 2002 B1
6460036 Herz Oct 2002 B1
6463533 Calamera et al. Oct 2002 B1
6505168 Rothman et al. Jan 2003 B1
6513018 Culhane Jan 2003 B1
6523021 Monberg et al. Feb 2003 B1
6523022 Hobbs Feb 2003 B1
6523041 Morgan et al. Feb 2003 B1
6543683 Hoffman Apr 2003 B2
6549944 Weinberg et al. Apr 2003 B1
6564210 Korda et al. May 2003 B1
6581059 Barrett et al. Jun 2003 B1
6601173 Mohler Jul 2003 B1
6601234 Bowman-Amuah Jul 2003 B1
6606744 Mikurak Aug 2003 B1
6611816 Lebda et al. Aug 2003 B2
6615247 Murphy Sep 2003 B1
6623529 Lakritz Sep 2003 B1
6640215 Galperin et al. Oct 2003 B1
6647383 August et al. Nov 2003 B1
6665715 Houri Dec 2003 B1
6671818 Mikurak Dec 2003 B1
6698020 Zigmond et al. Feb 2004 B1
6708166 Dysart et al. Mar 2004 B1
6748426 Shaffer et al. Jun 2004 B1
6754665 Futagami et al. Jun 2004 B1
6757740 Parekh et al. Jun 2004 B1
6766327 Morgan, Jr. et al. Jul 2004 B2
6766946 Iida et al. Jul 2004 B2
6801909 Delgado et al. Oct 2004 B2
6804346 Mewhinney Oct 2004 B1
6810356 Garcia-Franco et al. Oct 2004 B1
6845448 Chaganti et al. Jan 2005 B1
6873979 Fishman et al. Mar 2005 B2
6901406 Nabe et al. May 2005 B2
6910624 Natsuno Jun 2005 B1
6915269 Shapiro et al. Jul 2005 B1
6925441 Jones, III et al. Aug 2005 B1
6928487 Eggebraaten et al. Aug 2005 B2
6934714 Meinig Aug 2005 B2
6950858 Ogami Sep 2005 B2
6954757 Zargham et al. Oct 2005 B2
6959281 Freeling et al. Oct 2005 B1
6970830 Samra et al. Nov 2005 B1
6983379 Spalink et al. Jan 2006 B1
6983478 Grauch et al. Jan 2006 B1
6985887 Sunstein et al. Jan 2006 B1
6993493 Galperin et al. Jan 2006 B1
7003792 Yuen Feb 2006 B1
7023980 Lenard Apr 2006 B2
7028001 Muthuswamy et al. Apr 2006 B1
7031945 Donner Apr 2006 B1
7033792 Zhong et al. Apr 2006 B2
7035855 Kilger et al. Apr 2006 B1
7039176 Borodow et al. May 2006 B2
7039607 Watarai et al. May 2006 B2
7047251 Reed et al. May 2006 B2
7050982 Sheinson et al. May 2006 B2
7050989 Hurt et al. May 2006 B1
7054828 Heching et al. May 2006 B2
7069240 Spero et al. Jun 2006 B2
7072853 Shkedi Jul 2006 B2
7072963 Anderson et al. Jul 2006 B2
7076475 Honarvar Jul 2006 B2
7082435 Guzman et al. Jul 2006 B1
7085734 Grant et al. Aug 2006 B2
7092898 Mattick et al. Aug 2006 B1
7124144 Christianson et al. Oct 2006 B2
7133935 Hedy Nov 2006 B2
7136448 Venkataperumal et al. Nov 2006 B1
7150030 Eldering et al. Dec 2006 B1
7152018 Wicks Dec 2006 B2
7152237 Flickinger et al. Dec 2006 B2
7167907 Shaffer et al. Jan 2007 B2
7184974 Shishido Feb 2007 B2
7185016 Rasmussen Feb 2007 B1
7185353 Schlack Feb 2007 B2
7191144 White Mar 2007 B2
7194420 Ikezawa et al. Mar 2007 B2
7200602 Jonas Apr 2007 B2
7234160 Vogel et al. Jun 2007 B2
7236950 Savage et al. Jun 2007 B2
7240059 Bayliss et al. Jul 2007 B2
7246067 Austin et al. Jul 2007 B2
7249048 O'Flaherty Jul 2007 B1
7272591 Ghazal et al. Sep 2007 B1
7275083 Seibel et al. Sep 2007 B1
7277869 Starkman Oct 2007 B2
7296734 Pliha Nov 2007 B2
7305364 Nabe et al. Dec 2007 B2
7308418 Malek et al. Dec 2007 B2
7310617 Cunningham Dec 2007 B1
7313538 Wilmes et al. Dec 2007 B2
7328169 Temares et al. Feb 2008 B2
7360251 Spalink et al. Apr 2008 B2
7366694 Lazerson Apr 2008 B2
7367011 Ramsey et al. Apr 2008 B2
7370044 Mulhern et al. May 2008 B2
7370057 Burdick et al. May 2008 B2
7376603 Mayr et al. May 2008 B1
7376714 Gerken May 2008 B1
7383988 Slonecker, Jr. Jun 2008 B2
7392203 Edison et al. Jun 2008 B2
7395273 Khan et al. Jul 2008 B2
7403942 Bayliss Jul 2008 B1
7421322 Silversmith et al. Sep 2008 B1
7424439 Fayyad et al. Sep 2008 B1
7428509 Klebanoff Sep 2008 B2
7428526 Miller et al. Sep 2008 B2
7433864 Malik Oct 2008 B2
7444302 Hu et al. Oct 2008 B2
7451095 Bradley et al. Nov 2008 B1
7451113 Kasower Nov 2008 B1
7458508 Shao et al. Dec 2008 B1
7460857 Roach, Jr. Dec 2008 B2
7467401 Cicchitto Dec 2008 B2
7472088 Taylor et al. Dec 2008 B2
7478157 Bohrer et al. Jan 2009 B2
7499868 Galperin et al. Mar 2009 B2
7505938 Lang et al. Mar 2009 B2
7529689 Rowan May 2009 B2
7529698 Joao May 2009 B2
7533179 Tarquini et al. May 2009 B2
7536329 Goldberg et al. May 2009 B2
7536346 Aliffi et al. May 2009 B2
7536348 Shao et al. May 2009 B2
7546266 Beirne et al. Jun 2009 B2
7546619 Anderson et al. Jun 2009 B2
7552089 Bruer et al. Jun 2009 B2
7556192 Wokaty, Jr. Jul 2009 B2
7559217 Bass Jul 2009 B2
7562184 Henmi et al. Jul 2009 B2
7562814 Shao et al. Jul 2009 B1
7571139 Giordano et al. Aug 2009 B1
7580856 Pliha Aug 2009 B1
7587366 Grim, III et al. Sep 2009 B2
7590589 Hoffberg Sep 2009 B2
7593893 Ladd et al. Sep 2009 B1
7596512 Raines et al. Sep 2009 B1
7596716 Frost et al. Sep 2009 B2
7603701 Gaucas Oct 2009 B2
7606725 Robertson et al. Oct 2009 B2
7606778 Dewar Oct 2009 B2
7610257 Abrahams Oct 2009 B1
7647344 Skurtovich, Jr. et al. Jan 2010 B2
7653592 Flaxman et al. Jan 2010 B1
7668769 Baker et al. Feb 2010 B2
7668840 Bayliss et al. Feb 2010 B2
7672833 Blume et al. Mar 2010 B2
7672865 Kumar et al. Mar 2010 B2
7672924 Scheurich et al. Mar 2010 B1
7672926 Ghazal et al. Mar 2010 B2
7676751 Allen et al. Mar 2010 B2
7686214 Shao et al. Mar 2010 B1
7689505 Kasower Mar 2010 B2
7693787 Provinse Apr 2010 B2
7698163 Reed et al. Apr 2010 B2
7698236 Cox et al. Apr 2010 B2
7698445 Fitzpatrick et al. Apr 2010 B2
7707059 Reed et al. Apr 2010 B2
7711635 Steele et al. May 2010 B2
7711636 Robida et al. May 2010 B2
7715546 Pagel et al. May 2010 B2
7725300 Pinto et al. May 2010 B2
7730509 Boulet et al. Jun 2010 B2
7739139 Robertson et al. Jun 2010 B2
7742982 Chaudhuri et al. Jun 2010 B2
7747480 Agresta et al. Jun 2010 B1
7747559 Leitner et al. Jun 2010 B2
7752236 Williams et al. Jul 2010 B2
7756789 Welker et al. Jul 2010 B2
7765311 Itabashi et al. Jul 2010 B2
7769696 Yoda Aug 2010 B2
7774270 MacCloskey Aug 2010 B1
7783515 Kumar et al. Aug 2010 B1
7788040 Haskell et al. Aug 2010 B2
7788147 Haggerty et al. Aug 2010 B2
7793835 Coggeshall et al. Sep 2010 B1
7797252 Rosskamm et al. Sep 2010 B2
7797725 Lunt et al. Sep 2010 B2
7801812 Conlin et al. Sep 2010 B2
7801956 Cumberbatch et al. Sep 2010 B1
7814004 Haggerty et al. Oct 2010 B2
7814005 Imrey et al. Oct 2010 B2
7818228 Coulter Oct 2010 B1
7832006 Chen et al. Nov 2010 B2
7841008 Cole et al. Nov 2010 B1
7848972 Sharma Dec 2010 B1
7848978 Imrey et al. Dec 2010 B2
7849004 Choudhuri et al. Dec 2010 B2
7853518 Cagan Dec 2010 B2
7856386 Hazlehurst et al. Dec 2010 B2
7860786 Blackburn et al. Dec 2010 B2
7877304 Coulter Jan 2011 B1
7877320 Downey Jan 2011 B1
7899750 Klieman et al. Mar 2011 B1
7908242 Achanta Mar 2011 B1
7912865 Akerman et al. Mar 2011 B2
7925549 Looney et al. Apr 2011 B2
7930242 Morris et al. Apr 2011 B2
7962404 Metzger, II et al. Jun 2011 B1
7962501 Semprevivo et al. Jun 2011 B1
7974860 Travis Jul 2011 B1
7983932 Kane Jul 2011 B2
7991689 Brunzell et al. Aug 2011 B1
7991901 Tarquini et al. Aug 2011 B2
7996521 Chamberlain et al. Aug 2011 B2
7996912 Spalink et al. Aug 2011 B2
8001042 Brunzell et al. Aug 2011 B1
8001235 Russ et al. Aug 2011 B2
8005712 von Davier et al. Aug 2011 B2
8005759 Hirtenstein et al. Aug 2011 B2
8015045 Galperin et al. Sep 2011 B2
8024264 Chaudhuri et al. Sep 2011 B2
8027871 Williams et al. Sep 2011 B2
8036979 Torrez et al. Oct 2011 B1
8065233 Lee et al. Nov 2011 B2
8078453 Shaw Dec 2011 B2
8078524 Crawford et al. Dec 2011 B2
8078528 Vicente et al. Dec 2011 B1
8086524 Craig et al. Dec 2011 B1
8095443 DeBie Jan 2012 B2
8095458 Peterson et al. Jan 2012 B2
8099341 Varghese Jan 2012 B2
8099356 Feinstein et al. Jan 2012 B2
8126805 Sulkowski et al. Feb 2012 B2
8127982 Casey et al. Mar 2012 B1
8127986 Taylor et al. Mar 2012 B1
8131777 McCullough Mar 2012 B2
8135607 Williams et al. Mar 2012 B2
8145754 Chamberlain et al. Mar 2012 B2
8161104 Tomkow Apr 2012 B2
8175889 Girulat et al. May 2012 B1
8201257 Andres et al. Jun 2012 B1
8234498 Britti et al. Jul 2012 B2
8271313 Williams et al. Sep 2012 B2
8271378 Chaudhuri et al. Sep 2012 B2
8280805 Abrahams et al. Oct 2012 B1
8285577 Galperin et al. Oct 2012 B1
8285656 Chang et al. Oct 2012 B1
8290840 Kasower Oct 2012 B2
8296229 Yellin et al. Oct 2012 B1
8301574 Kilger et al. Oct 2012 B2
8312033 McMillan Nov 2012 B1
8315943 Torrez et al. Nov 2012 B2
8321952 Spalink et al. Nov 2012 B2
8386377 Xiong et al. Feb 2013 B1
8392334 Hirtenstein et al. Mar 2013 B2
8412593 Song et al. Apr 2013 B1
8463919 Tarquini et al. Jun 2013 B2
8468198 Tomkow Jun 2013 B2
8478674 Kapczynski et al. Jul 2013 B1
8515828 Wolf et al. Aug 2013 B1
8515862 Zhang et al. Aug 2013 B2
8533322 Chamberlain et al. Sep 2013 B2
8560434 Morris et al. Oct 2013 B2
8560666 Low Oct 2013 B2
8566167 Munjal Oct 2013 B2
8572083 Snell et al. Oct 2013 B1
8606626 DeSoto et al. Dec 2013 B1
8606666 Courbage et al. Dec 2013 B1
8626563 Williams et al. Jan 2014 B2
8626646 Torrez et al. Jan 2014 B2
8639616 Rolenaitis et al. Jan 2014 B1
8639920 Stack et al. Jan 2014 B2
8705718 Baniak et al. Apr 2014 B2
8732004 Ramos et al. May 2014 B1
8738515 Chaudhuri et al. May 2014 B2
8738516 Dean et al. May 2014 B1
8768914 Scriffignano et al. Jul 2014 B2
8781953 Kasower Jul 2014 B2
8818888 Kapczynski et al. Aug 2014 B1
8930251 DeBie Jan 2015 B2
8966649 Stack et al. Feb 2015 B2
9058340 Chamberlain et al. Jun 2015 B1
20010011245 Duhon Aug 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010029470 Schultz et al. Oct 2001 A1
20010029482 Tealdi et al. Oct 2001 A1
20010039523 Iwamoto Nov 2001 A1
20010049620 Blasko Dec 2001 A1
20020004736 Roundtree et al. Jan 2002 A1
20020023051 Kunzle et al. Feb 2002 A1
20020026394 Savage et al. Feb 2002 A1
20020026507 Sears et al. Feb 2002 A1
20020026519 Itabashi et al. Feb 2002 A1
20020029162 Mascarenhas Mar 2002 A1
20020035684 Vogel et al. Mar 2002 A1
20020046099 Frengut et al. Apr 2002 A1
20020049701 Nabe et al. Apr 2002 A1
20020049738 Epstein Apr 2002 A1
20020049968 Wilson et al. Apr 2002 A1
20020051020 Ferrari et al. May 2002 A1
20020055906 Katz et al. May 2002 A1
20020069122 Yun et al. Jun 2002 A1
20020069203 Dar et al. Jun 2002 A1
20020077964 Brody et al. Jun 2002 A1
20020082892 Raffel et al. Jun 2002 A1
20020083043 Hoshi et al. Jun 2002 A1
20020091650 Ellis Jul 2002 A1
20020091706 Anderson et al. Jul 2002 A1
20020099628 Takaoka et al. Jul 2002 A1
20020099641 Mills et al. Jul 2002 A1
20020099824 Bender et al. Jul 2002 A1
20020099936 Kou et al. Jul 2002 A1
20020103809 Starzl et al. Aug 2002 A1
20020111910 Walsh Aug 2002 A1
20020119824 Allen Aug 2002 A1
20020120504 Gould et al. Aug 2002 A1
20020123904 Amengual et al. Sep 2002 A1
20020123928 Eldering et al. Sep 2002 A1
20020128960 Lambiotte et al. Sep 2002 A1
20020128962 Kasower Sep 2002 A1
20020129368 Schlack et al. Sep 2002 A1
20020133404 Pedersen Sep 2002 A1
20020133504 Vlahos et al. Sep 2002 A1
20020138331 Hosea et al. Sep 2002 A1
20020138333 DeCotiis et al. Sep 2002 A1
20020138334 DeCotiis et al. Sep 2002 A1
20020138470 Zhou Sep 2002 A1
20020147669 Taylor et al. Oct 2002 A1
20020147695 Khedkar et al. Oct 2002 A1
20020147801 Gullotta et al. Oct 2002 A1
20020156676 Ahrens et al. Oct 2002 A1
20020161496 Yamaki Oct 2002 A1
20020161664 Shaya et al. Oct 2002 A1
20020169747 Chapman et al. Nov 2002 A1
20020188544 Wizon et al. Dec 2002 A1
20020198824 Cook Dec 2002 A1
20030009418 Green et al. Jan 2003 A1
20030018578 Schultz Jan 2003 A1
20030018769 Foulger et al. Jan 2003 A1
20030023489 McGuire et al. Jan 2003 A1
20030023531 Fergusson Jan 2003 A1
20030033242 Lynch et al. Feb 2003 A1
20030041031 Hedy Feb 2003 A1
20030041050 Smith et al. Feb 2003 A1
20030046222 Bard et al. Mar 2003 A1
20030046311 Baidya et al. Mar 2003 A1
20030060284 Hamalainen et al. Mar 2003 A1
20030065563 Elliott et al. Apr 2003 A1
20030069839 Whittington et al. Apr 2003 A1
20030078877 Beirne et al. Apr 2003 A1
20030097342 Whittingtom May 2003 A1
20030097380 Mulhern et al. May 2003 A1
20030101111 Dang et al. May 2003 A1
20030101344 Wheeler et al. May 2003 A1
20030105728 Yano et al. Jun 2003 A1
20030110293 Friedman et al. Jun 2003 A1
20030120591 Birkhead et al. Jun 2003 A1
20030144950 O'Brien et al. Jul 2003 A1
20030158776 Landesmann Aug 2003 A1
20030167222 Mehrotra et al. Sep 2003 A1
20030200135 Wright Oct 2003 A1
20030200151 Ellenson et al. Oct 2003 A1
20030212654 Harper et al. Nov 2003 A1
20030216965 Libman Nov 2003 A1
20030219709 Olenick et al. Nov 2003 A1
20030229507 Perge Dec 2003 A1
20030229892 Sardera Dec 2003 A1
20030233278 Marshall Dec 2003 A1
20030233323 Bilski et al. Dec 2003 A1
20030233655 Gutta et al. Dec 2003 A1
20040006488 Fitall et al. Jan 2004 A1
20040010458 Friedman Jan 2004 A1
20040024848 Smith Feb 2004 A1
20040030649 Nelson et al. Feb 2004 A1
20040030667 Xu et al. Feb 2004 A1
20040039688 Sulkowski et al. Feb 2004 A1
20040044673 Brady et al. Mar 2004 A1
20040049729 Penfield Mar 2004 A1
20040059626 Smallwood Mar 2004 A1
20040062213 Koss Apr 2004 A1
20040078809 Drazin Apr 2004 A1
20040083215 de Jong Apr 2004 A1
20040088237 Moenickheim et al. May 2004 A1
20040088255 Zielke et al. May 2004 A1
20040098625 Lagadec et al. May 2004 A1
20040102197 Dietz May 2004 A1
20040103147 Flesher et al. May 2004 A1
20040107125 Guheen et al. Jun 2004 A1
20040111305 Gavan et al. Jun 2004 A1
20040111359 Hudock Jun 2004 A1
20040117235 Shacham Jun 2004 A1
20040117358 Von Kaenel et al. Jun 2004 A1
20040122730 Tucciarone et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040128150 Lundegren Jul 2004 A1
20040128193 Brice et al. Jul 2004 A1
20040128230 Oppenheimer et al. Jul 2004 A1
20040128236 Brown et al. Jul 2004 A1
20040133509 McCoy et al. Jul 2004 A1
20040133513 McCoy et al. Jul 2004 A1
20040133515 McCoy et al. Jul 2004 A1
20040138932 Johnson et al. Jul 2004 A1
20040139025 Coleman Jul 2004 A1
20040143596 Sirkin Jul 2004 A1
20040153330 Miller et al. Aug 2004 A1
20040153509 Alcorn et al. Aug 2004 A1
20040153521 Kogo Aug 2004 A1
20040163101 Swix Aug 2004 A1
20040176995 Fusz Sep 2004 A1
20040193538 Raines Sep 2004 A1
20040199456 Flint et al. Oct 2004 A1
20040199462 Starrs Oct 2004 A1
20040199584 Kirshenbaum et al. Oct 2004 A1
20040199789 Shaw et al. Oct 2004 A1
20040205157 Bibelnieks et al. Oct 2004 A1
20040220865 Lozowski et al. Nov 2004 A1
20040220918 Scriffignano et al. Nov 2004 A1
20040225594 Nolan, III et al. Nov 2004 A1
20040225643 Alpha et al. Nov 2004 A1
20040230534 McGough Nov 2004 A1
20040230820 Hui Hsu et al. Nov 2004 A1
20040243588 Tanner et al. Dec 2004 A1
20040261116 Mckeown et al. Dec 2004 A1
20040267714 Frid et al. Dec 2004 A1
20050005168 Dick Jan 2005 A1
20050010555 Gallivan Jan 2005 A1
20050021397 Cui et al. Jan 2005 A1
20050027995 Menschik et al. Feb 2005 A1
20050049991 Aggarwal Mar 2005 A1
20050050027 Yeh et al. Mar 2005 A1
20050055231 Lee Mar 2005 A1
20050065809 Henze Mar 2005 A1
20050071328 Lawrence Mar 2005 A1
20050091164 Varble Apr 2005 A1
20050097039 Kulcsar et al. May 2005 A1
20050102180 Gailey et al. May 2005 A1
20050113991 Rogers et al. May 2005 A1
20050120045 Klawon Jun 2005 A1
20050144067 Farahat et al. Jun 2005 A1
20050144452 Lynch et al. Jun 2005 A1
20050144641 Lewis Jun 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050177489 Neff et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050201272 Wang et al. Sep 2005 A1
20050204381 Ludvig et al. Sep 2005 A1
20050209922 Hofmeister Sep 2005 A1
20050222900 Fuloria et al. Oct 2005 A1
20050222906 Chen Oct 2005 A1
20050226224 Lee et al. Oct 2005 A1
20050234969 Mamou et al. Oct 2005 A1
20050246338 Bird Nov 2005 A1
20050251474 Shinn et al. Nov 2005 A1
20050251820 Stefanik et al. Nov 2005 A1
20050257250 Mitchell et al. Nov 2005 A1
20050273849 Araujo et al. Dec 2005 A1
20050278246 Friedman et al. Dec 2005 A1
20050278743 Flickinger et al. Dec 2005 A1
20050279824 Anderson et al. Dec 2005 A1
20050279827 Mascavage et al. Dec 2005 A1
20050288954 McCarthy et al. Dec 2005 A1
20050288998 Verma et al. Dec 2005 A1
20060004626 Holmen et al. Jan 2006 A1
20060004731 Seibel et al. Jan 2006 A1
20060014129 Coleman et al. Jan 2006 A1
20060015425 Brooks Jan 2006 A1
20060020611 Gilbert et al. Jan 2006 A1
20060036543 Blagg et al. Feb 2006 A1
20060041443 Horvath Feb 2006 A1
20060059073 Walzak Mar 2006 A1
20060074991 Lussier et al. Apr 2006 A1
20060080233 Mendelovich et al. Apr 2006 A1
20060080251 Fried et al. Apr 2006 A1
20060085334 Murphy Apr 2006 A1
20060085361 Hoerle et al. Apr 2006 A1
20060085454 Blegen et al. Apr 2006 A1
20060095363 May May 2006 A1
20060100954 Schoen May 2006 A1
20060122921 Comerford et al. Jun 2006 A1
20060136330 DeRoy et al. Jun 2006 A1
20060155573 Hartunian Jul 2006 A1
20060155639 Lynch et al. Jul 2006 A1
20060173772 Hayes et al. Aug 2006 A1
20060177226 Ellis, III Aug 2006 A1
20060178971 Owen et al. Aug 2006 A1
20060178983 Nice et al. Aug 2006 A1
20060184440 Britti et al. Aug 2006 A1
20060195866 Thukral Aug 2006 A1
20060206379 Rosenberg Sep 2006 A1
20060206416 Farias Sep 2006 A1
20060212350 Ellis et al. Sep 2006 A1
20060212353 Roslov et al. Sep 2006 A1
20060218079 Goldblatt et al. Sep 2006 A1
20060224696 King et al. Oct 2006 A1
20060229943 Mathias et al. Oct 2006 A1
20060229996 Keithley et al. Oct 2006 A1
20060230415 Roeding Oct 2006 A1
20060242039 Haggerty et al. Oct 2006 A1
20060242046 Haggerty et al. Oct 2006 A1
20060242047 Haggerty et al. Oct 2006 A1
20060242048 Haggerty et al. Oct 2006 A1
20060242050 Haggerty et al. Oct 2006 A1
20060253323 Phan et al. Nov 2006 A1
20060259364 Strock et al. Nov 2006 A1
20060271457 Romain et al. Nov 2006 A1
20060271472 Cagan Nov 2006 A1
20060276171 Pousti Dec 2006 A1
20060277089 Hubbard et al. Dec 2006 A1
20060277092 Williams Dec 2006 A1
20060282328 Gerace et al. Dec 2006 A1
20060282359 Nobili et al. Dec 2006 A1
20060282856 Errico et al. Dec 2006 A1
20060287915 Boulet et al. Dec 2006 A1
20060287919 Rubens et al. Dec 2006 A1
20060293921 McCarthy et al. Dec 2006 A1
20060293954 Anderson et al. Dec 2006 A1
20060293955 Wilson et al. Dec 2006 A1
20060293979 Cash et al. Dec 2006 A1
20060294199 Bertholf Dec 2006 A1
20070011020 Martin Jan 2007 A1
20070011039 Oddo Jan 2007 A1
20070016500 Chatterji et al. Jan 2007 A1
20070016518 Atkinson et al. Jan 2007 A1
20070022032 Anderson et al. Jan 2007 A1
20070022141 Singleton et al. Jan 2007 A1
20070022297 Britti et al. Jan 2007 A1
20070027778 Schellhammer et al. Feb 2007 A1
20070027791 Young et al. Feb 2007 A1
20070030282 Cash et al. Feb 2007 A1
20070033227 Gaito et al. Feb 2007 A1
20070038483 Wood Feb 2007 A1
20070038497 Britti et al. Feb 2007 A1
20070038516 Apple et al. Feb 2007 A1
20070047714 Baniak et al. Mar 2007 A1
20070061195 Liu et al. Mar 2007 A1
20070061243 Ramer et al. Mar 2007 A1
20070067207 Haggerty et al. Mar 2007 A1
20070067297 Kublickis Mar 2007 A1
20070067437 Sindambiwe Mar 2007 A1
20070078835 Donnelli Apr 2007 A1
20070083460 Bachenheimer Apr 2007 A1
20070094137 Phillips et al. Apr 2007 A1
20070094230 Subramaniam et al. Apr 2007 A1
20070094241 Blackwell et al. Apr 2007 A1
20070100719 Chwast et al. May 2007 A1
20070106582 Baker et al. May 2007 A1
20070112668 Celano et al. May 2007 A1
20070118393 Rosen et al. May 2007 A1
20070121843 Atazky et al. May 2007 A1
20070124235 Chakraborty et al. May 2007 A1
20070129993 Alvin Jun 2007 A1
20070130070 Williams Jun 2007 A1
20070156515 Hasselback et al. Jul 2007 A1
20070156554 Nikoley et al. Jul 2007 A1
20070156589 Zimler et al. Jul 2007 A1
20070157110 Gandhi et al. Jul 2007 A1
20070168246 Haggerty et al. Jul 2007 A1
20070169189 Crespo et al. Jul 2007 A1
20070174122 Howard et al. Jul 2007 A1
20070185797 Robinson Aug 2007 A1
20070192165 Haggerty et al. Aug 2007 A1
20070192409 Kleinstern et al. Aug 2007 A1
20070204338 Aiello et al. Aug 2007 A1
20070208619 Branam et al. Sep 2007 A1
20070208640 Banasiak et al. Sep 2007 A1
20070208729 Martino Sep 2007 A1
20070214000 Shahrabi et al. Sep 2007 A1
20070220553 Branam et al. Sep 2007 A1
20070220611 Socolow et al. Sep 2007 A1
20070226093 Chan et al. Sep 2007 A1
20070226130 Haggerty et al. Sep 2007 A1
20070233857 Cheng et al. Oct 2007 A1
20070244732 Chatterji et al. Oct 2007 A1
20070250459 Schwarz et al. Oct 2007 A1
20070261114 Pomerantsev Nov 2007 A1
20070271178 Davis et al. Nov 2007 A1
20070271582 Ellis et al. Nov 2007 A1
20070282684 Prosser et al. Dec 2007 A1
20070282730 Carpenter et al. Dec 2007 A1
20070282736 Conlin et al. Dec 2007 A1
20070288271 Klinkhammer Dec 2007 A1
20070288360 Seeklus Dec 2007 A1
20070288950 Downey et al. Dec 2007 A1
20070288953 Sheeman et al. Dec 2007 A1
20070294126 Maggio Dec 2007 A1
20070294163 Harmon et al. Dec 2007 A1
20070299759 Kelly Dec 2007 A1
20070299771 Brody Dec 2007 A1
20080005313 Flake et al. Jan 2008 A1
20080010206 Coleman Jan 2008 A1
20080021802 Pendleton Jan 2008 A1
20080028067 Berkhin et al. Jan 2008 A1
20080033742 Bernasconi Feb 2008 A1
20080040216 Dellovo Feb 2008 A1
20080046383 Hirtenstein et al. Feb 2008 A1
20080052182 Marshall Feb 2008 A1
20080052244 Tsuei et al. Feb 2008 A1
20080059224 Schechter Mar 2008 A1
20080059317 Chandran et al. Mar 2008 A1
20080059352 Chandran Mar 2008 A1
20080059449 Webster et al. Mar 2008 A1
20080065569 Dutt et al. Mar 2008 A1
20080065774 Keeler Mar 2008 A1
20080086368 Bauman et al. Apr 2008 A1
20080091535 Heiser et al. Apr 2008 A1
20080097928 Paulson Apr 2008 A1
20080103972 Lanc May 2008 A1
20080109875 Kraft May 2008 A1
20080115191 Kim et al. May 2008 A1
20080120155 Pliha May 2008 A1
20080120569 Mann et al. May 2008 A1
20080126476 Nicholas et al. May 2008 A1
20080133325 De et al. Jun 2008 A1
20080134042 Jankovich Jun 2008 A1
20080154766 Lewis et al. Jun 2008 A1
20080167956 Keithley Jul 2008 A1
20080172324 Johnson Jul 2008 A1
20080177655 Zalik Jul 2008 A1
20080177836 Bennett Jul 2008 A1
20080183504 Highley Jul 2008 A1
20080183564 Tien et al. Jul 2008 A1
20080184289 Cristofalo et al. Jul 2008 A1
20080201401 Pugh et al. Aug 2008 A1
20080205655 Wilkins et al. Aug 2008 A1
20080208735 Balet et al. Aug 2008 A1
20080208873 Boehmer Aug 2008 A1
20080215470 Sengupta et al. Sep 2008 A1
20080221970 Megdal et al. Sep 2008 A1
20080221990 Megdal et al. Sep 2008 A1
20080228556 Megdal et al. Sep 2008 A1
20080228578 Mashinsky Sep 2008 A1
20080228635 Megdal et al. Sep 2008 A1
20080249869 Angell et al. Oct 2008 A1
20080255897 Megdal et al. Oct 2008 A1
20080263058 Peden Oct 2008 A1
20080270209 Mauseth et al. Oct 2008 A1
20080270294 Lent et al. Oct 2008 A1
20080294540 Celka et al. Nov 2008 A1
20080294546 Flannery Nov 2008 A1
20080301016 Durvasula et al. Dec 2008 A1
20080301727 Cristofalo et al. Dec 2008 A1
20080306750 Wunder et al. Dec 2008 A1
20080312969 Raines et al. Dec 2008 A1
20090006475 Udezue et al. Jan 2009 A1
20090018996 Hunt et al. Jan 2009 A1
20090024428 Hudock, Jr. Jan 2009 A1
20090024505 Patel et al. Jan 2009 A1
20090030776 Walker et al. Jan 2009 A1
20090031426 Dal Lago et al. Jan 2009 A1
20090043691 Kasower Feb 2009 A1
20090044246 Sheehan et al. Feb 2009 A1
20090055894 Lorsch Feb 2009 A1
20090060343 Rosca Mar 2009 A1
20090076883 Kilger et al. Mar 2009 A1
20090089205 Bayne Apr 2009 A1
20090094640 Anderson et al. Apr 2009 A1
20090094674 Schwartz et al. Apr 2009 A1
20090112650 Iwane Apr 2009 A1
20090113532 Lapidous Apr 2009 A1
20090119169 Chandratillake et al. May 2009 A1
20090119199 Salahi May 2009 A1
20090132559 Chamberlain et al. May 2009 A1
20090133058 Kouritzin et al. May 2009 A1
20090138335 Lieberman May 2009 A1
20090144102 Lopez Jun 2009 A1
20090144201 Gierkink et al. Jun 2009 A1
20090150166 Leite et al. Jun 2009 A1
20090150238 Marsh et al. Jun 2009 A1
20090164380 Brown Jun 2009 A1
20090172035 Lessing et al. Jul 2009 A1
20090172815 Gu et al. Jul 2009 A1
20090177480 Chen et al. Jul 2009 A1
20090222373 Choudhuri et al. Sep 2009 A1
20090222374 Choudhuri et al. Sep 2009 A1
20090222375 Choudhuri et al. Sep 2009 A1
20090222376 Choudhuri et al. Sep 2009 A1
20090222377 Choudhuri et al. Sep 2009 A1
20090222378 Choudhuri et al. Sep 2009 A1
20090222379 Choudhuri et al. Sep 2009 A1
20090222380 Choudhuri et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234665 Conkel Sep 2009 A1
20090240609 Cho et al. Sep 2009 A1
20090248567 Haggerty et al. Oct 2009 A1
20090248568 Haggerty et al. Oct 2009 A1
20090248569 Haggerty et al. Oct 2009 A1
20090248570 Haggerty et al. Oct 2009 A1
20090248571 Haggerty et al. Oct 2009 A1
20090248572 Haggerty et al. Oct 2009 A1
20090248573 Haggerty et al. Oct 2009 A1
20090249440 Platt et al. Oct 2009 A1
20090254375 Martinez et al. Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090271248 Sherman et al. Oct 2009 A1
20090271265 Lay et al. Oct 2009 A1
20090276233 Brimhall et al. Nov 2009 A1
20090288109 Downey et al. Nov 2009 A1
20090313163 Wang et al. Dec 2009 A1
20090327120 Eze et al. Dec 2009 A1
20090328173 Jakobson et al. Dec 2009 A1
20100010935 Shelton Jan 2010 A1
20100017300 Bramlage et al. Jan 2010 A1
20100023434 Bond Jan 2010 A1
20100030649 Ubelhor Feb 2010 A1
20100037255 Sheehan et al. Feb 2010 A1
20100049803 Ogilvie et al. Feb 2010 A1
20100094704 Subramanian et al. Apr 2010 A1
20100094758 Chamberlain et al. Apr 2010 A1
20100114663 Casas et al. May 2010 A1
20100114724 Ghosh et al. May 2010 A1
20100138290 Zschocke et al. Jun 2010 A1
20100145836 Baker et al. Jun 2010 A1
20100145840 Kasower Jun 2010 A1
20100169159 Rose et al. Jul 2010 A1
20100169264 O'Sullivan Jul 2010 A1
20100185453 Satyavolu et al. Jul 2010 A1
20100211636 Starkenburg et al. Aug 2010 A1
20100217837 Ansari et al. Aug 2010 A1
20100250434 Megdal et al. Sep 2010 A1
20100250497 Redlich et al. Sep 2010 A1
20100268660 Ekdahl Oct 2010 A1
20110016042 Cho et al. Jan 2011 A1
20110023115 Wright Jan 2011 A1
20110029388 Kendall et al. Feb 2011 A1
20110047071 Choudhuri et al. Feb 2011 A1
20110071950 Ivanovic Mar 2011 A1
20110076663 Krallman et al. Mar 2011 A1
20110078073 Annappindi et al. Mar 2011 A1
20110093383 Haggerty et al. Apr 2011 A1
20110112958 Haggerty et al. May 2011 A1
20110113084 Ramnani May 2011 A1
20110125595 Neal et al. May 2011 A1
20110126275 Anderson et al. May 2011 A1
20110137760 Rudie et al. Jun 2011 A1
20110137789 Kortina et al. Jun 2011 A1
20110142213 Baniak et al. Jun 2011 A1
20110145122 Haggerty et al. Jun 2011 A1
20110164746 Nice et al. Jul 2011 A1
20110178899 Huszar Jul 2011 A1
20110179139 Starkenburg et al. Jul 2011 A1
20110184838 Winters et al. Jul 2011 A1
20110213641 Metzger, II et al. Sep 2011 A1
20110219421 Ullman et al. Sep 2011 A1
20110251946 Haggerty et al. Oct 2011 A1
20110258050 Chan et al. Oct 2011 A1
20110264581 Clyne Oct 2011 A1
20110270618 Banerjee et al. Nov 2011 A1
20110307397 Benmbarek Dec 2011 A1
20120011056 Ward et al. Jan 2012 A1
20120011158 Avner et al. Jan 2012 A1
20120016948 Sinha Jan 2012 A1
20120030216 Churi et al. Feb 2012 A1
20120047219 Feng et al. Feb 2012 A1
20120054592 Jaffe et al. Mar 2012 A1
20120066065 Switzer Mar 2012 A1
20120072464 Cohen Mar 2012 A1
20120095927 Hirtenstein et al. Apr 2012 A1
20120110467 Blake et al. May 2012 A1
20120110677 Abendroth et al. May 2012 A1
20120124498 Santoro et al. May 2012 A1
20120136763 Megdal et al. May 2012 A1
20120136768 DeBie May 2012 A1
20120136774 Imrey et al. May 2012 A1
20120158574 Brunzell et al. Jun 2012 A1
20120158654 Behren et al. Jun 2012 A1
20120173339 Flynt et al. Jul 2012 A1
20120179536 Kalb et al. Jul 2012 A1
20120215682 Lent et al. Aug 2012 A1
20120239497 Nuzzi Sep 2012 A1
20120239515 Batra et al. Sep 2012 A1
20120265607 Belwadi Oct 2012 A1
20120290660 Rao et al. Nov 2012 A1
20130031109 Routson et al. Jan 2013 A1
20130080315 Torrez et al. Mar 2013 A1
20130080467 Carson et al. Mar 2013 A1
20130085804 Leff et al. Apr 2013 A1
20130125010 Strandell May 2013 A1
20130132151 Stibel et al. May 2013 A1
20130173481 Hirtenstein et al. Jul 2013 A1
20130185293 Boback Jul 2013 A1
20130218638 Kilger et al. Aug 2013 A1
20130218751 Chaudhuri et al. Aug 2013 A1
20130279676 Baniak et al. Oct 2013 A1
20130332338 Yan et al. Dec 2013 A1
20140025815 Low Jan 2014 A1
20140032265 Paprocki et al. Jan 2014 A1
20140096249 Dupont et al. Apr 2014 A1
20140164398 Smith et al. Jun 2014 A1
20140164519 Shah Jun 2014 A1
Foreign Referenced Citations (65)
Number Date Country
1290372 May 2001 CN
91 08 341 Oct 1991 DE
0 554 083 Aug 1993 EP
0 749 081 Dec 1996 EP
1 028 401 Aug 2000 EP
1 122 664 Aug 2001 EP
10-222559 Aug 1998 JP
10-261009 Sep 1998 JP
10-293732 Nov 1998 JP
11-068828 Mar 1999 JP
2000-331068 Nov 2000 JP
2001-297141 Oct 2001 JP
2001-344463 Dec 2001 JP
2001-357256 Dec 2001 JP
2002-149778 May 2002 JP
2002-163498 Jun 2002 JP
2002-259753 Sep 2002 JP
2003-271851 Sep 2003 JP
2003-316881 Nov 2003 JP
10-2000-0036594 Jul 2000 KR
10-2000-0063995 Nov 2000 KR
10-2001-0016349 Mar 2001 KR
10-2002-0007132 Jan 2002 KR
10-2001-0035145 May 2002 KR
10-2004-0078798 Sep 2004 KR
WO 9103789 Mar 1991 WO
WO 9406103 Mar 1994 WO
WO 9642041 Dec 1996 WO
WO 9723838 Jul 1997 WO
WO 9841913 Sep 1998 WO
WO 9849643 Nov 1998 WO
WO 9857285 Dec 1998 WO
WO 9904350 Jan 1999 WO
WO 9922328 May 1999 WO
WO 9932985 Jul 1999 WO
WO 9933012 Jul 1999 WO
WO 9937066 Jul 1999 WO
WO 9959375 Nov 1999 WO
WO 9967731 Dec 1999 WO
WO 0055789 Sep 2000 WO
WO 0055790 Sep 2000 WO
WO 0068862 Nov 2000 WO
WO 0110090 Feb 2001 WO
WO 0111522 Feb 2001 WO
WO 0125896 Apr 2001 WO
WO 0175754 Oct 2001 WO
WO 0184281 Nov 2001 WO
WO 0213025 Feb 2002 WO
WO 03101123 Dec 2003 WO
WO 2004114160 Dec 2004 WO
WO 2006110873 Oct 2006 WO
WO 2007149941 Dec 2007 WO
WO 2008022289 Feb 2008 WO
WO 2008054403 May 2008 WO
WO 2008076343 Jun 2008 WO
WO 2008127288 Oct 2008 WO
WO 2008147918 Dec 2008 WO
WO 2009117518 Sep 2009 WO
WO 2009132114 Oct 2009 WO
WO 2010045160 Apr 2010 WO
WO 2010062537 Jun 2010 WO
WO 2010132492 Nov 2010 WO
WO 2010150251 Dec 2010 WO
WO 2011005876 Jan 2011 WO
WO 2014018900 Jan 2014 WO
Non-Patent Literature Citations (180)
Entry
U.S. Appl. No. 60/146,074, filed Jul. 28, 1999, Tomkow.
U.S. Appl. No. 60/172,479, filed Dec. 17, 1999, Tomkow.
“Accenture Launches Media Audit and Optimization Service to Help U.S. Companies Measure Return on Investment in Advertising,” Business Wire, May 22, 2006, 2 pages, http://findarticles.com/p/articles/mi—m0EIN/is—2006—May—22/ai—n16374159.
“Accenture Newsroom: Accenture Completes Acquisition of Media Audits: Acquisition Expands Company's Marketing Sciences and Data Services Capabilities,” accenture.com, Dec. 12, 2005, 2 pages, http://accenture.tekgroup.com/article—display.cfm?article—id=428.
“Aggregate and Analyze Social Media Content: Gain Faster and Broader Insight to Market Sentiment,” SAP Partner, Mantis Technology Group, Apr. 2011, pp. 4.
Akl, Selim G., “Digital Signatures: A Tutorial Survey,” Computer, Feb. 1983, pp. 15-24.
“Atlas on Demand, Concurrent, and Everstream Strike Video-on-Demand Advertising Alliance”, www.atlassolutions.com, Jul. 13, 2006, 3 pages.
“Arbitron 2006 Black Consumers,” Arbitron Inc., lvtsg.com, Jul. 8, 2006, 2 pages, http://www.lvtsg.com/news/publish/Factoids/article—3648.shtml.
“Atlas on Demand and C-COR Join Forces to Offer Advertising Management Solution for on Demand TV: Global Provider of on Demand Systems Partners with Atlas to Develop and Market Comprehensive VOD Advertising Solution,” www.atlassolutions.com, Jul. 25, 2005, 3 pages.
“Atlas on Demand and Tandberg Television Join Forces to Enhance Dynamic Ad Placement for On-Demand Television: Combined End-to End Solution to Provide Media Buying and Selling Communities with New Tools for Dynamic Advertising that Eliminate Technical Bar” Jun. 22, 2006—3 pages, http://www.atlassolutions.com/news—20060622.aspx.
ADZILLA, Press Release, “ZILLACASTING Technology Approved and Patent Pending,” http://www.adzilla.com/newsroom/pdf/patent—051605.pdf, May 16, 2005, pp. 2.
AFX New Limited—AFX International Focus, “Nielsen moving to measure off-TV viewing,” Jun. 14, 2006, 1 page.
Bachman, Katy, “Arbitron, VNU Launch Apollo Project,” mediaweek.com Jan. 17, 2006, 3 pages, http://www.mediaweek.com/mw/search/article—display.jsp?schema=&vnu—content—id=1001847353.
“Bank of America Launches Total Security Protection™; Features Address Cardholders' Financial Safety Concerns; Supported by $26 Million National Advertising Campaign; Free Educational Materials”, PR Newswire, Oct. 9, 2002, pp. 2.
BBC Green Home, “My Action Plan”, as printed from The Wayback Machine at http://web.archive.org/web/20080513014731/http://www.bbcgreen.com/actionplan, May 13, 2008, pp. 50.
BERR: Department for Business Enterprise & Regulatory Reform, “Regional Energy Consumption Statistics”, Jun. 10, 2008, http://webarchive.nationalarchives.gov.uk/20080610182444/http://www.berr.gov.uk/energy/statistics/regional/index.html.
Bitran et al., “Mailing Decisions in Catalog Sales Industry”, Management Science (JSTOR), vol. 42, No. 9, pp. 1364-1381, Sep. 1996.
Blackbaud.com, www.blackbaud.com, various pages, retrieved Jan. 22, 2009 from www.archive.org, 23 pages.
Bult et al., “Optimal Selection for Direct Mail,” Marketing Science, 1995, vol. 14, No. 4, pp. 378-394.
Burr Ph.D., et al., “Utility Payments as Alternative Credit Data: A Reality Check”, Asset Builders of America, Inc., Oct. 5, 2006, pp. 1-18, Washington, D.C.
Buxfer, http://www.buxfer.com/ printed Feb. 5, 2014 in 1 page.
“Cable Solution Now, The Industry Standard for Information Management: Strata's TIM.net Crosses Important Threshold Dominant Solution for All Top 20 TV Markets,” stratag.com, Apr. 28, 2006, 1 page, http://stratag.com/news/cablepress042806.html.
Caliendo, et al., “Some Practical Guidance for the Implementation of Propensity Score Matching”, IZA:Discussion Paper Series, No. 1588, Germany, May 2005, pp. 32.
“Carbon Calculator—Calculation Explanation,” Warwick University Carbon Footprint Project Group, 2005, pp. 5, http://www.carboncalculator.co.uk/explanation.php.
Chung, Charles; Internet Retailer, “Multi-channel retailing requires the cleanest data—but don't expect it from the customer”, Jan./Feb. 2002.
Check, http://check.me/ printed Feb. 5, 2014 in 3 pages.
“Claritas Forms Life Insurance Consortium with Worldwide Financial Services Association: Initiative with LIMRA International is First of its Kind to Provide Actual Sales Information at Small Geographic Areas,” Feb. 9, 2006, 3 pages, http://www.claritas.com/claritas/Default/jsp?ci=5&si=1&pn=limra.
“Claritas Introduces PRIZM NE Consumer Electronic Monitor Profiles: New Information Product Provides Insight Into The Public's Purchasing Behaviors of Consumer Electronics,” May 30, 2006, 3 pages.
“Consumer Reports Finds American-Made Vehicles Close Reliability Gap with European-Made Vehicle—As Japanese Continue to Set New Benchmarks for the Industry”, Consumer Reports: Consumers Union, Yonkers, NY, Apr. 2003.
Click Z, “ISPs Collect User Data for Behavioral Ad Targeting,” dated Jan. 3, 2008, printed from http://www.clickz.com/showPage.html?page=clickz Apr. 16, 2008.
cnet news.com, “Target me with your ads, please,” dated Dec. 5, 2007, printed from http://www.news.com/2102-1024—3-6221241.html?tag+st.util.print Mar. 18, 2008.
Creamer, Matthew; Consulting in marketing; Accenture, Others Playing Role in Firms' Processes, Crain's Chicago Business, Jun. 12, 2006, 2 pages.
Culhane, Patrick, “Data: Powerfully Linking Service and Profitability,” Jul./Aug. 1996, Bank Management, vol. 72, No. 4, pp. 8-12.
“Database Marketing: A new Approach to the Old Relationships,” Chain Storage Executive Edition, Dialogue, Sep. 1991, pp. 2.
“Data Loss Prevention (DLP) Software”, http://www.symantec.com/data-loss-prevention/ printed Apr. 8, 2013 in 8 pages.
“Data Protection”, http://compliantprocessing.com/data-protection printed Apr. 8, 2013 in 4 pages.
Davies, Donald W., “Applying the RSA Digital Signature to Electronic Mail,” Computer, Feb. 1983, pp. 55-62.
“Debt Settlement: Watch Video on how to Pay Your Debt Faster”, http://www.debtconsolidationcare.com/debt-settlement.html printed Jan. 9, 2013 in 6 pages.
Delany et al., “Firm Mines Offline Data to Target Online”, http://web.archive.org/web/20071117140456/http://www.commercialalert.org/news/archive/2007/10/firm-mines-offline-data-to-target-online-ads, Commercial Alert, Oct. 17, 2007, pp. 3.
demographicsnow.com, sample reports, “Age Rank Report”, Jul. 17, 2006, 3 pages.
demographicsnow.com, sample reports, “Consumer Expenditure Summary Report”, Jul. 17, 2006, 3 pages.
demographicsnow.com, sample reports, “Income Comparison Report”, Jul. 17, 2006, 4 pages.
Egol, Len; “What's New in Database Marketing Software,” Direct, Aug. 1994, vol. 6, No. 8, pp. 39.
Energy Saving TrustTM, “HEED Online User Manual (1.7)”, Jul. 24, 2008, pp. 18, www.energysavingtrust.org.uk, Jul. 24, 2008.
“Epsilon Leads Discussion on Paradigm Shift in TV Advertising,” epsilon.com, Jun. 24, 2004, 2 pages, http://www.epsilon.com/who-pr—tvad040624.html.
Ettorre, “Paul Kahn on Exceptional Marketing,” Management Review, vol. 83, No. 11, Nov. 1994, pp. 48-51.
Experian-Scorex Announces New Credit Simulation Tool, PR Newswire, Costa Mesa, CA, Jun. 13, 2005.
“Fair Isaac Introduces Falcon One System to Combat Fraud at Every Customer Interaction”, Business Wire, May 5, 2005, pp. 3.
“Fair Isaac Offers New Fraud Tool”, National Mortgage News & Source Media, Inc., Jun. 13, 2005, pp. 2.
Fanelli, Marc, “Building a Holistic Customer View”, MultiChannel Merchant, Jun. 26, 2006, pp. 2.
Fisher, Joseph, “Access to Fair Credit Reports: Current Practices and Proposed Legislation,” American Business Law Journal, Fall 1981, vol. 19, No. 3, p. 319.
Frontporch, “Ad Networks—Partner with Front Porch!,” www.frontporch.com printed Apr. 2008 in 2 pages.
Frontporch, “New Free Revenue for Broadband ISPs!”, http://www.frontporch.com/html/bt/FPBroadbandISPs.pdf printed May 28, 2008 in 2 pages.
Garcia-Molina, “Database Systems: The Complete Book”, Prentice Hall, 2002, pp. 713-715.
Georges, et al., “KDD'99 Competition: Knowledge Discovery Contest”, SAS Institute, 1999, 6 pages.
“GLBA Compliance and FFIEC Compliance” http://www.trustwave.com/financial-services.php printed Apr. 8, 2013 in 1 page.
Gonul, et al., “Optimal Mailing of Catalogs: A New Methodology Using Estimable Structural Dynamic Programming Models”, 14 pages, Management Science, vol. 44, No. 9, Sep. 1998.
Halliday, Jean, “Ford Recruits Accenture for Marketing Plan,” Automotive News Feb. 13, 2006, 2 pages, Crain Communications.
Hartfeil, Guenther, “Bank One Measures Profitability of Customers, Not Just Products,” Journal of Retail Banking Services, Aug. 1996, vol. 18, No. 2, pp. 23-29.
Haughton et al., “Direct Marketing Modeling with CART and CHAID”, Journal of Direct Marketing, Fall 1997, vol. 11, No. 4, pp. 42-52.
Helm, Burt, “Nielsen's New Ratings Yardstick,” businessweek.com, Jun. 20, 2006, 3 pages, http://www.businessweek.com/technology/content/jun2006/tc20060620—054223.htm.
Hinman, Donald P., “The Perfect Storm: Response Metrics and Digital TV,” chiefmarketer.com, May 17, 2006, 2 pages, http://www.chiefmarketer.com/crm—loop/roi/perfect-storm-051706/index.html.
Ideon, Credit-Card Registry that Bellyflopped this Year, Is Drawing some Bottom-Fishers, The Wall Street Journal, Aug. 21, 1995, pp. C2.
Information Resources, Inc. and Navic Networks Form Joint Relationship to Support Next Generation of Technology for Advertising Testing, IRI Expands BehaviorScan® Solution to Meet Digital and On-demand Needs, Feb. 27, 2006, http://us.infores.com/page/news/pr/pr—archive?mode=single&pr—id=117, printed Oct. 4, 2007 in 2 pages.
Instant Access to Credit Reports Now Available Online with DMS' CreditBrowser-based system also Simplifies Credit Decisioning and Offers a Central Point of Control, Business Wire, p. 0264, Dallas, May 23, 2000.
“Intelligent Miner Applications Guide”, IBM Corp., Apr. 2, 1999, Chapters 4-7, pp. 33-132.
“IRI and Acxiom Introduce More Efficient and Actionable Approach to Consumer Segmentation and Targeted Marketing,” eu-marketingportal.de, Jan. 26, 2006, 2 pages, http://www.eu-marketingportal.de.
“Japan's JAAI system appraises used cars over internet”, Asia Pulse, Mar. 3, 2000.
Jost, Allen; Neural Networks, Credit World, Mar./Apr. 1993, vol. 81, No. 4, pp. 26-33.
Jowit, Juliette, “Ever wondered how big your own carbon footprint might be?”, Nov. 4, 2007, pp. 4, http://www.guardian.co.uk/money/2007/nov/04/cash.carbonfootprints/print.
King et al., Local and Regional CO2 Emissions Estimates for 2004 for the UK, AEA Energy & Environment, Report for Department for Environment, Food and Rural Affairs, Nov. 2006, London, UK, pp. 73.
Kohavi, Ron, “A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection”, Internation Joint Conference on Artificial Intelligence, 1995, pp. 7.
Lamons, Bob, “Be Smart: Offer Inquiry Qualification Services,” Marketing News, ABI/Inform Global, Nov. 6, 1995, vol. 29, No. 23, pp. 13.
Lanubile, et al., “Evaluating Empirical Models for the Detection of High-Risk Components: Some Lessons Learned”, 20th Annual Software Engineering Workshop, Nov. 29-30, 1995, Greenbelt, Maryland, pp. 1-6.
LeadVerifier: Why Should You Use LeadVerifier?, downloaded from www.leadverifier.com/LeadVerifier—Why.asp, dated Feb. 7, 2006 on www.archive.org.
LendingTree.com, “Lender Ratings & Reviews,” http://web.archive.org/web/20091015043716/http://www.lendingtree.com/lender-reviews/, Oct. 15, 2009, in 21 pages.
Leskovec, Jure, “Social Media Analytics: Tracking, Modeling and Predicting the Flow of Information through Networks”, WWW 2011—Tutorial, Mar. 28-Apr. 1, 2011, Hyderabad, India, pp. 277-278.
Littwin, Angela, “Beyond Usury: A Study of Credit-Card Use and Preference Among Low-Income Consumers”, Texas Law Review, vol. 86, No. 3, pp. 451-506; Feb. 2008.
Loshin, Intelligent Enterprise: Better Insight for Business Decisions, “Value-Added Data: Merge Ahead”, Feb. 9, 2000, vol. 3, No. 3, 5 pages.
Manilla, http://www.manilla.com/how-it-works/ printed Feb. 5, 2014 in 1 page.
McNamara, Paul, “Start-up's pitch: The Envelope, please,” Network World, Apr. 28, 1997, vol. 14, No. 17, p. 33.
“Mediamark Research Inc. Releases Findings From Mobile Marketing Consumer Study; Outback Steakhouse and Royal Caribbean Cruise Lines Among Brands Participating in Mobile Marketing Research,” www.thefreelibrary.com, May 9, 2006, 4 pages.
Miller, Joe, “NADA used-car prices go online”, Automotive News, Jun. 14, 1999, p. 36.
Mint.com, http://www.mint.com/how-it-works/ printed Feb. 5, 2013 in 2 pages.
Morrissey, Brian, “Aim High: Ad Targeting Moves to the Next Level”, ADWEEK, dated Jan. 21, 2008 as downloaded from http://www.adweek.com/aw/magazine/article—display.isp?vnu on Apr. 16, 2008.
Muus, et al., “A Decision Theoretic Framework for Profit Maximization in Direct Marketing”, Sep. 1996, pp. 20.
Mvelopes, http://www.mvelopes.com/ printed Feb. 5, 2014 in 2 pages.
MyReceipts, http://www.myreceipts.com/, printed Oct. 16, 2012 in 1 page.
MyReceipts—How it Works, http://www.myreceipts.com/howItWorks.do, printed Oct. 16, 2012 in 1 page.
NebuAd, “Venture Capital: What's New—The Latest on Technology Deals From Dow Jones VentureWire”, Press Release, http://www.nebuad.com/company/media—coverage/media—10—22—07.php, Oct. 22, 2007, pp. 2.
Organizing Maniac's Blog—Online Receipts Provided by MyQuickReceipts.com, http://organizingmaniacs.wordpress.com/2011/01/12/online-receipts-provided-by-myguickreceipts-com/ dated Jan. 12, 2011 printed Oct. 16, 2012 in 3 pages.
Otter, et al., “Direct Mail Selection by Joint Modeling of the Probability and Quantity of Response”, Jun. 1997, pp. 14.
Padgett et al., “A Comparison of Carbon Calculators”, Environmental Impact Assessment Review 28, pp. 106-115, Jun. 7, 2007.
Perry et al., “Integrating Waste and Renewable Energy to Reduce the Carbon Footprint of Locally Integrated Energy Sectors”, Energy 33, Feb. 15, 2008, pp. 1489-1497.
PersonalCapital.com, http://www.personalcapital.com/how-it-works printed Feb. 5, 2014 in 5 pages.
Planet Receipt—Home, http://www.planetreceipt.com/home printed Oct. 16, 2012 in 2 pages.
Planet Receipt—Solutions & Features, http://www.planetreceipt.com/solutions-features printed Oct. 16, 2012 in 2 pages.
Polatoglu et al., “Theory and Methodology, Probability Distributions of Cost, Revenue and Profit over a Warranty Cycle”, European Journal of Operational Research, Jul. 1998, vol. 108, Issue 1, pp. 170-183.
“PostX to Present at Internet Showcase”, PR Newswire, Apr. 28, 1997, pp. 2.
PostX, “PostX® Envelope and ActiveView”, http://web.archive.org/web/19970714203719/http://www.postx.com/priducts—fm.html, Jul. 14, 1997 as retrieved Nov. 7, 2013 in 2 pages.
PR Web: Press Release Newswire, Anchor Launches LeadVerifier to Verify, Correct and Enhance Internet Leads, Jul. 19, 2005, pp. 2 pages, Farmingdale, NY.
Predictive Behavioral Targeting http://www.predictive-behavioral-targeting.com/index.php.Main—Page as printed Mar. 28, 2008 in 4 pages.
“PremierGuide Announces Release 3.0 of Local Search Platform”, Business Wire, Mar. 4, 2004, Palo Alto, CA, p. 5574.
“Qualifying for Debt Settlement”, http://www.certifieddebt.com/debt/settlement-qualifications.shtml printed Jan. 9, 2013 in 2 pages.
RAP Interactive, Inc. and Web Decisions: Proudly Presents Live Decisions, A Powerful New Information and Technology Resource that Revolutionizes Interactive Marketing, downloaded from www.webdecisions.com/pdf/LiveDecisions—Bro.pdf, as printed on Aug. 13, 2007.
Reinbach, Andrew; MCIF aids banks in CRA Compliance, Bank Systems & Technology, Aug. 1995, vol. vol. 32, Issue No. 8, Pages pp. 27.
“Resolve Debt for Less: With Help from Freedom Financial” http://www.debtsettlementusa.com/ printed Jan. 9, 2013 in 6 pages.
Rossi et al.; “The Value of Purchasing History Data in Target Marketing”; Marketing Science, Apr. 1996, vol. 15, No. 4, pp. 321-340.
Sakia, R.M., “The Box-Cox Transformation Technique: a Review”, The Statistician, 41, 1992, pp. 169-178.
SalesLogix.net, SalesLogix Sales Tour, Apr. 11, 2001, http:///www.saleslogix.com , pp. 19.
Sawyers, Arlena, “NADA to Offer Residual Guide”, Automotive News, May 22, 2000, p. 3.
Sax, Michael M., Data Collection and Privacy Protection: An International Perspective, Presentation: Managing Online Risk and Liability Conference, Aug. 31, 1999, pp. 58.
Schmittlein et al., “Customer Base Analysis: An Industrial Purchase Process Application”, Marketing Science, vol. 13, No. 1, Winter 1994, pp. 41-67.
“Settling Your Debts—Part 1 in Our Debt Settlement Series”, http://www.creditinfocenter.com/debt/settle—debts.shtml printed Jan. 9, 2013 in 6 pages.
ShoeBoxed, https://www.shoeboxed.com/sbx-home/ printed Oct. 16, 2012 in 4 pages.
Smith, Richard M., “The Web Bug FAQ”, Nov. 11, 1999, Version 1.0, pp. 4.
“SRC Announces Free Dashups to Mashups Adding Geographic Business Intelligence at Web Speed to the Enterprise on www.FreeDemographics.com/API,” directionsmag.com, Jun. 12, 2006, 3 pages, http://www.directionsmag.com/press.releases/index.php?duty=Show&id=1.
“SRC Delivers Industry's First Drive Time Engine Developed to Follow Actual Road Networks,” thomasnet.com, May 21, 2006, 4 pages, http://news.thomasnet.com/companystory/485722.
Sumner, Anthony, “Tackling the Issue of Bust-Out Fraud”, Retail Banker International, Jul. 24, 2007, pp. 4.
Sweat, Jeff; “Know Your Customers,” Information Week, Nov. 30, 1998, pp. 20.
Tao, Lixin, “Shifting Paradigms with the Application Service Provider Model”; Concordia University, IEEE, Oct. 2001, Canada.
TARGUSinfo: Lead Verification, Verify Your Leads With Unique Accuracy and Ease, downloaded from www.targusinfo.com/solutions/verify/Default.asp, as printed Aug. 1, 2006.
TARGUSinfo: Solutions: Services: Verify Express—Verify, Correct and Enhance Customer Provided Data, http://web.archive.org/web/20051028122545/http://www.targusinfo.com/solutions/services/verify/, Oct. 28, 2005, as printed Apr. 30, 2011, 27 pgs.
Thoemmes, Felix, “Propensity Score Matching in SPSS”, Center for Educational Science and Psychology, University of Tübingen, Jan. 2012.
UPI, “Nielsen Media Research goes electronic,” Jun. 14, 2006, 1 page.
“VOD Integration Now Available in Strata: Buyers / Sellers Benefit from VOD Component on Popular Platform,” stratag.com, Feb. 21, 2006, 1 page, http://www.stratag.com/news/mediapress022106.html.
“WashingtonPost.com and Cars.com launch comprehensive automotive web site for the Washington area”, PR Newswire, Oct. 22, 1998.
White, Ron, “How Computers Work”, Millennium Edition, Que Corporation, Indianapolis, IN, Sep. 1999. [Uploaded in 2 parts].
Whitney, Daisy; Atlas Positioning to Shoulder VOD Ads; Campaign Management Tools Optimize Inventory, TelevisionWeek, May 23, 2005, 3 pages.
Wiedmann, et al., “Report No. 2: The use of input-output analysis in REAP to allocate Ecological Footprints and material flows to final consumption categories”, Resources and Energy Analysis Programme, Stockholm Environment Institute—York, Feb. 2005, York, UK, pp. 33.
Wyner, “Customer valuation: Linking behavior and economics”, Aug. 1996, Marketing Research: A Magazine of Management & Applications vol. 8, No. 2 pp. 36-38.
Yodlee | Money Center, https://yodleemoneycenter.com/ printed Feb. 5, 2014 in 2 pages.
You Need a Budget, http://www.youneedabudget.com/features printed Feb. 5, 2014 in 3 pages.
Declaration of Paul Clark, DSc. for Inter Partes Review of U.S. Pat. No. 8,504,628 (Symantec Corporation, Petitioner), dated Jan. 15, 2014 in 76 pages.
Exhibit D to Joint Claim Construction Statement, filed in Epsilon Data Management, LLC, No. 2:12-cv-00511-JRG (E.D. Tex.) (combined for pretrial purposes with RPost Holdings. Inc., et al. v. Experian Marketing Solutions. Inc., No. 2:12-cv-00513-JRG (E.D. Tex.)) Filed Jan. 14, 2014 in 9 pages.
First Amended Complaint in Civil Action No. 2:12-cv-511-JRG (Rpost Holdings, Inc. and Rpost Communications Limited V. Constant Contact, Inc.; et al.) filed Feb. 11, 2013 in 14 pages.
First Amended Complaint in Civil Action No. 2:12-cv-511-JRG (Rpost Holdings, Inc. and Rpost Communications Limited V. Epsilon Data Management, LLC.) filed Sep. 13, 2013 in 9 pages.
First Amended Complaint in Civil Action No. 2:12-cv-513-JRG (Rpost Holdings, Inc. and Rpost Communications Limited V. Experian Marketing Solutions, Inc.) filed Aug. 30, 2013 in 9 pages.
Petition for Covered Business Method Patent Review in U.S. Pat. No. 8,161,104 (Experian Marketing Solutions, Inc., Epsilon Data Management, LLC, and Constant Contact, Inc., v. Rpost Communications Limited) dated Jan. 29, 2014 in 90 pages.
Source Code Appendix attached to U.S. Appl. No. 08/845,722 by Venkatraman et al., Exhibit A, Part 1 & 2, pp. 32.
Official Communication in Canadian Patent Application No. 2,381,349, dated May 17, 2013.
Official Communication in Canadian Patent Application No. 2,381,349, dated Jul. 31, 2014.
International Search Report and Written Opinion for Application No. PCT/US2007/021815, dated Sep. 5, 2008.
International Search Report and Written Opinion in PCT/US08/083939, dated Jan. 29, 2009.
International Search Report and Written Opinion for Application No. PCT/US09/60393, dated Dec. 23, 2009.
International Search Report and Written Opinion for Application No. PCT/US2010/034434, dated Jun. 23, 2010.
International Preliminary Report on Patentability for Application No. PCT/US2010/034434, dated Feb. 4, 2014.
U.S. Appl. No. 12/705,489, filed Feb. 12, 2010, Bargoli et al.
U.S. Appl. No. 12/705,511, filed Feb 12, 2010, Bargoli et al.
Applied Geographic Solutions, “What is MOSAIC™”, as captured Feb. 15, 2004 from http://web.archive.org/web/20040215224329/http://www.appliedgeographic.com/mosaic.html in 2 pages.
Axiom, “Capabilites”, http://www.axiomcom.com/capabilities/, printed May 7, 2015 in 2 pages.
“Bank of America Direct Web-Based Network Adds Core Functionality to Meet Day-to-Day Treasury Needs”, Business Wire, Oct. 25, 1999. pp. 2.
Brown et al., “ALCOD IDSS:Assisting the Australian Stock Market Surveillance Team's Review Process,” Applied Artificial Intelligence Journal, Dec. 1, 1996, pp. 625-641.
Card Marketing, Use the Latest CRM Tools and Techniques, www.CardForum.com, vol. 5 No. 10, Dec. 2001.
ChannelWave.com, PRM Central—About PRM, http://web.archive.org/web/20000510214859/http://www.channelwave.com as printed on Jun. 21, 2006, May 2000 Archive.
“Chase Gets Positive,” Bank Technology News, May 6, 2000, vol. 14, No. 5, p. 33.
“Cole Taylor Bank Chooses Integrated E-Banking/E-Payments/Reconciliation Solution From Fundtech”, Business Wire, Oct. 21, 1999, pp. 2.
deGruchy, et al., “Geodemographic Profiling Benefits Stop-Smoking Service;” The British Journal of Healthcare Computing & Information Management; Feb. 2007; 24, 7; pp. 29-31.
Drawbridge, “Customer Success”, http://www.drawbrid.ge/customer-success, printed May 7, 2015 in 17 pages.
Drawbridge, “Solutions”, http://www.drawbrid.ge/solutions, printed May 7, 2015 in 5 pages.
Drawbridge, “Technology”, http://www.drawbrid.ge/technology, printed May 7, 2015 in 3 pages.
Dstillery, “Products”, http://dstillery.com/how-we-do-it/products/, printed May 7, 2015 in 2 pages.
Dstillery, “What We Do”, http://dstillery.com/what-we-dot printed May 7, 2015 in 2 pages.
Dstillery, “Who We Are”, http://dstillery.com/who-we-are/, printed May 7, 2015 in 2 pages.
Dymi, Amilda, Need for Leads Spurs Some Upgrades, Origination News—Special Report, May 1, 2008, vol. vol. 17, Issue No. 8, Pages p. 24, Atlanta, Copyright 2008 SourceMedia, Inc.
Experian and AGS Select SRC to Deliver Complete Marketing Solutions; Partnership First to Marketplace with Census2000 Data. PR Newswire. New York: Mar. 21, 2001. p. 1.
“Experian Launches Portfolio Monitor—Owner NoticesSM”, News Release, Feb. 2003, Costa Mesa, CA.
“FTC Testifies: Identity Theft on the Rise”, FTC News Release, Mar. 7, 2000, pp. 3.
Gilje, Shelby, “Keeping Tabs on Businesses That Keep Tabs on Us”, NewsRoom, The Seattle Times, Section: SCENE, Apr. 19, 1995, pp. 4.
Hill, Kerry, “Identity Theft Your Social Security Number Provides Avenue for Thieves”, NewsRoom, Wisconsin State Journal, Sep. 13, 1998, pp. 4.
Karlan et al., “Observing Unobservables:Identifying Information Asymmetries with a Consumer Credit Field Experiment”, Jun. 17, 2006, pp. 58, http://aida.econ.yale.edu/karlan/papers/ObservingUnobservables.KarlanZinman.pdf.
Longo, Tracey, “Managing Money: Your Family Finances”, Kiplinger's Personal Finance Magazine, Jun. 1, 1995, vol. 49, No. 6, pp. 4.
McManus et al.; “Street Wiser,” American Demographics; ABI/Inform Global; Jul./Aug. 2003; 25, 6; pp. 32-35.
“New Privista Product Provides Early Warning System to Combat Identity Theft”, PR Newswire, Oct. 24, 2000, PR Newswire Association, Inc., New York.
Stein, Benchmarking Default Prediction Models: Pitfalls and Remedies in Model Validation, Moody's KMV, Revised Jun. 13, 2002, Technical Report #020305; New York.
Webber, Richard, “The Relative Power of Geodemographics vis a vis Person and Household Level Demographic Variables as Discriminators of Consumer Behavior,” CASA:Working Paper Series, http://www.casa.ucl.ac.uk/working—papers/paper84.pdf, Oct. 2004, pp. 17.
Yoon, Chang Woo; “Vicarious Certification and Billing Agent for Web Information Service”, High Speed Network Access Section, Electronics and Telecommunications Research Institute, Jan. 21-23, 1998, pp. 344-349.
Zen et al., “Value-Added Internet: a Pragmatic TINA-Based Path to the Internet and PSTN Integration”, Global Convergence of Telecommunications and Distribute Object Computing, Nov. 17-20, 1997, pp. 10.
International Search Report and Written Opinion for Application No. PCT/US2008/064594, dated Oct. 30, 2008.
International Search Report and Written Opinion for Application No. PCT/US2013/052342, dated Nov. 21, 2013.
Related Publications (1)
Number Date Country
20150262246 A1 Sep 2015 US
Provisional Applications (1)
Number Date Country
61177205 May 2009 US
Continuations (2)
Number Date Country
Parent 14162498 Jan 2014 US
Child 14627338 US
Parent 12777998 May 2010 US
Child 14162498 US