Abstract: Generating a cannibalism score for a paid ad in a search engine results page (SERP) by gathering keywords relevant to an advertiser, defining rules that compute a cannibalism score for the ad in relation to a corresponding unpaid listing, where the cannibalism score estimates the reduction in revenue to the advertiser due to the ad appearing in the same SERP as the corresponding listing, providing a keyword to a search engine, receiving a SERP from the search engine, determining the position of a first ad placed by the advertiser from among one or more ads in the SERP, determining the position of a corresponding unpaid listing from among a plurality of unpaid listings in the SERP, and applying the rules to the ad and to the corresponding unpaid listing to obtain a cannibalism score for the ad.

Abstract: The invention is a system based on decentralized ledgers to enable compliance with privacy regulations. A consumer identifier (consumer ID) allows consent provenance to be saved in a shared decentralized ledger. The consent ID also empowers consumers to query as to how their data has been moved through the data supply chain. The consumer data itself is not stored in the blockchain, only consents and data transfer events. A consent API allows companies to enter the original consumer consent in a consent ledger; a data transfer API allows companies to record transfers from one to another; and a subscription API allows companies to be notified of changes to a given consent.

Abstract: Generating a cannibalism score for a paid ad in a search engine results page (SERP) by gathering keywords relevant to an advertiser, defining rules that compute a cannibalism score for the ad in relation to a corresponding unpaid listing, where the cannibalism score estimates the reduction in revenue to the advertiser due to the ad appearing in the same SERP as the corresponding listing, providing a keyword to a search engine, receiving a SERP from the search engine, determining the position of a first ad placed by the advertiser from among one or more ads in the SERP, determining the position of a corresponding unpaid listing from among a plurality of unpaid listings in the SERP, and applying the rules to the ad and to the corresponding unpaid listing to obtain a cannibalism score for the ad.

Abstract: Generating a cannibalism score for a paid ad in a search engine results page (SERP) by gathering keywords relevant to an advertiser, defining rules that compute a cannibalism score for the ad in relation to a corresponding unpaid listing, where the cannibalism score estimates the reduction in revenue to the advertiser due to the ad appearing in the same SERP as the corresponding listing, providing a keyword to a search engine, receiving a SERP from the search engine, determining the position of a first ad placed by the advertiser from among one or more ads in the SERP, determining the position of a corresponding unpaid listing from among a plurality of unpaid listings in the SERP, and applying the rules to the ad and to the corresponding unpaid listing to obtain a cannibalism score for the ad.

Abstract: A system for “horizontal” salting of database tables, text files, and data feeds utilizes a key field and character position within that field (the “Key Character”) and a Salting Field, which contains content that can legitimately be in one of at least two states without impacting the usefulness of the data. A unique identifier, which is assigned to the recipient of the data, is hidden within the data by using the variations of the states in the Salting Field, with the value of the Key Character identifying the position within the unique identifier. This type of salting is invisible to the recipient of the data file, does not alter the accuracy of the data, and can be made unique for a particular party receiving data files or unique for each data file.

Abstract: Generating an estimate of reclaimed ad spend for an Internet advertising campaign, by receiving a set of keywords, where each keyword corresponds to a paid ad that is supplied to a search engine, gathering a cannibalism score for each paid ad, where a cannibalism score indicates that the presence of a designated paid ad in a SERP reduces the chance that a user will click on a corresponding unpaid listing, and estimating a reclaimed ad spend as the difference between the actual revenue reported for a period of time and an estimate of the expected ad spend for a comparable period of time when de-cannibalizing actions were taken; and reporting the estimate of the reclaimed ad spend.

Abstract: A system and method for identifying a leaked data file and assigning guilt to one or more suspected leakers proceeds through a plurality of levels. At a first level, primary watermark detection occurs. Data is inserted into a subset of data to determine correlation with data in the suspected leaked file. The guilt probability that results is then weighted based on the number of bits matched. In a second level, another search process is performed for detecting additional salt-related patterns. The guilt score is then computed for every detected recipient identifier for the suspected leaked data file, and the relative guilt of these recipients is weighted. In a third layer, the statistical distribution of data in the suspected leaked file is compared with that of corresponding data in the reference files. After this layer is complete, the average of guilt scores across each of the layers is calculated.

Abstract: Generating an estimate of reclaimed ad spend for an Internet advertising campaign, by receiving a set of keywords, where each keyword corresponds to a paid ad that is supplied to a search engine, gathering a cannibalism score for each paid ad, where a cannibalism score indicates that the presence of a designated paid ad in a SERP reduces the chance that a user will click on a corresponding unpaid listing, and estimating a reclaimed ad spend as the difference between the actual revenue reported for a period of time and an estimate of the expected ad spend for a comparable period of time when de-cannibalizing actions were taken; and reporting the estimate of the reclaimed ad spend.

Abstract: The invention is a system based on decentralized ledgers to enable compliance with privacy regulations. A consumer identifier (consumer ID) allows consent provenance to be saved in a shared decentralized ledger. The consent ID also empowers consumers to query as to how their data has been moved through the data supply chain. The consumer data itself is not stored in the blockchain, only consents and data transfer events. A consent API allows companies to enter the original consumer consent in a consent ledger; a data transfer API allows companies to record transfers from one to another; and a subscription API allows companies to be notified of changes to a given consent.

Abstract: Generating a cannibalism score for a paid ad in a search engine results page (SERP) by gathering keywords relevant to an advertiser, defining rules that compute a cannibalism score for the ad in relation to a corresponding unpaid listing, where the cannibalism score estimates the reduction in revenue to the advertiser due to the ad appearing in the same SERP as the corresponding listing, providing a keyword to a search engine, receiving a SERP from the search engine, determining the position of a first ad placed by the advertiser from among one or more ads in the SERP, determining the position of a corresponding unpaid listing from among a plurality of unpaid listings in the SERP, and applying the rules to the ad and to the corresponding unpaid listing to obtain a cannibalism score for the ad.

Abstract: A system and method for salting and fingerprinting database tables, text files, data feeds, and the like, first resorts the data according to a field or fields in the data set. A salting recipe is selected and applied to the sorted data. A fingerprint of the data is captured after sorting and salting. The data is then restored to its original order before being sent to a trusted third party. Because the data owner retains information concerning the sorting sorting sonar technique, salting technique, and the fingerprint, the data owner can reconstruct the unsalted file from the salted file, and can determine if a wild file contains data from the data file. The salting is difficult to detect by the bad actor, even if the bad actor is aware that the data has been salted.

Abstract: A system for “horizontal” salting of database tables, text files, and data feeds utilizes a key field and character position within that field (the “Key Character”) and a Salting Field, which contains content that can legitimately be in one of at least two states without impacting the usefulness of the data. A unique identifier, which is assigned to the recipient of the data, is hidden within the data by using the variations of the states in the Salting Field, with the value of the Key Character identifying the position within the unique identifier. This type of salting is invisible to the recipient of the data file, does not alter the accuracy of the data, and can be made unique for a particular party receiving data files or unique for each data file.

Abstract: A system for “horizontal” salting of database tables, text files, and data feeds utilizes a key field and character position within that field (the “Key Character”) and a Salting Field, which contains content that can legitimately be in one of at least two states without impacting the usefulness of the data. A unique identifier, which is assigned to the recipient of the data, is hidden within the data by using the variations of the states in the Salting Field to represent a binary 0 or 1, with the value of the Key Character identifying the bit position of the binary 0 or 1 within the unique identifier. This type of salting is invisible to the recipient of the data file, does not alter the accuracy of the data, and can be made unique for a particular party receiving data files or unique for each data file.

Abstract: A system and method for salting and fingerprinting database tables, text files, data feeds, and the like, first resorts the data according to a field or fields in the data set. A salting recipe is selected and applied to the sorted data. A fingerprint of the data is captured after sorting and salting. The data is then restored to its original order before being sent to a trusted third party. Because the data owner retains information concerning the sorting sorting sonar technique, salting technique, and the fingerprint, the data owner can reconstruct the unsalted file from the salted file, and can determine if a wild file contains data from the data file. The salting is difficult to detect by the bad actor, even if the bad actor is aware that the data has been salted.

Abstract: A system and method for identifying a leaked data file and assigning guilt to one or more suspected leakers proceeds through a plurality of levels. At a first level, primary watermark detection occurs. Data is inserted into a subset of data to determine correlation with data in the suspected leaked file. The guilt probability that results is then weighted based on the number of bits matched. In a second level, another search process is performed for detecting additional salt-related patterns. The guilt score is then computed for every detected recipient identifier for the suspected leaked data file, and the relative guilt of these recipients is weighted. In a third layer, the statistical distribution of data in the suspected leaked file is compared with that of corresponding data in the reference files. After this layer is complete, the average of guilt scores across each of the layers is calculated.

Abstract: A system for “horizontal” salting of database tables, text files, and data feeds utilizes a key field and character position within that field (the “Key Character”) and a Salting Field, which contains content that can legitimately be in one of at least two states without impacting the usefulness of the data. A unique identifier, which is assigned to the recipient of the data, is hidden within the data by using the variations of the states in the Salting Field to represent a binary 0 or 1, with the value of the Key Character identifying the bit position of the binary 0 or 1 within the unique identifier. This type of salting is invisible to the recipient of the data file, does not alter the accuracy of the data, and can be made unique for a particular party receiving data files or unique for each data file.

Abstract: A method and a device for search engine optimization, that receives an identifier that identifies a domain, one or more keywords for analysis relative to a search engine, and search engine usage data, for each received keyword, gathering search engine results data, for at least one received keyword, mapping the at least one keyword to at least one web page within the identified domain, said mapping based on at least one of said search engine usage data and said search engine results data, and for at least one of the received keywords, generating at least one instruction to modify a web page element in a web page to which the at least one received keyword is mapped.

Abstract: A method and a device for search engine optimization, that receives an identifier that identifies a domain, one or more keywords for analysis relative to a search engine, and search engine usage data, for each received keyword, gathering search engine results data, for at least one received keyword, mapping the at least one keyword to at least one web page within the identified domain, said mapping based on at least one of said search engine usage data and said search engine results data, and for at least one of the received keywords, generating at least one instruction to modify a web page element in a web page to which the at least one received keyword is mapped.

Abstract: A method for search engine keyword bidding, including providing a search engine that is used by shoppers to search for products and services, maintaining by an advertiser a keyword database used by the search engine, collecting by the advertiser statistics for revenue generated during each Internet session on the advertiser's website that begins when a shopper visits the advertiser's landing page in response to the shopper clicking on an advertiser's sponsored ad, maintaining by the advertiser a tracking database comprising records of Internet sessions for a plurality of shoppers, and periodically revising by the advertiser a bid amount for a keyword in the keyword database, based on total revenue in the tracking database corresponding to the keyword over a given time period.