Abstract: A watermark image may be generated that includes a first set of encoded pixels each of which is assigned a first transparency value and a second set of encoded pixels each of which is assigned a second transparency value, the second transparency level being different from the first transparency level. The encoded pixels may be distributed among a set of blank pixels such that each encoded pixel neighbors one or more blank pixels in the watermark image, and in particular at least two blank pixels in the watermark image. Herein, each blank pixel may be assigned the second transparency value. The watermark image may be overlaid and blended over a background source image to create an encoded source image. A decoder system may recover encoded information from the encoded source image.

Abstract: A watermark image may be generated that includes a first set of encoded pixels each of which is assigned a first transparency value and a second set of encoded pixels each of which is assigned a second transparency value, the second transparency level being different from the first transparency level. The encoded pixels may be distributed among a set of blank pixels such that each encoded pixel neighbors one or more blank pixels in the watermark image, and in particular at least two blank pixels in the watermark image. Herein, each blank pixel may be assigned the second transparency value. The watermark image may be overlaid and blended over a background source image to create an encoded source image. A decoder system may recover encoded information from the encoded source image.

Abstract: A computer-implemented method for protecting user identity within online content providing environments uses a security content management system (CMS) including at least one processor and a memory. The method includes identifying a request for an online content item associated with an online device. The online device is associated with actual device data. The method also includes determining a first characteristic value associated with the actual device data of the online device. The method further includes generating, by the processor, substitute device data. The substitute device data represents at least the first characteristic value. The method also includes providing the substitute device data to an online content provider.

Abstract: A watermark image may be generated that includes a first set of encoded pixels each of which is assigned a first transparency value and a second set of encoded pixels each of which is assigned a second transparency value, the second transparency level being different from the first transparency level. The encoded pixels may be distributed among a set of blank pixels such that each encoded pixel neighbors one or more blank pixels in the watermark image, and in particular at least two blank pixels in the watermark image. Herein, each blank pixel may be assigned the second transparency value. The watermark image may be overlaid and blended over a background source image to create an encoded source image. A decoder system may recover encoded information from the encoded source image.

Abstract: A watermark image may be generated that includes a first set of encoded pixels each of which is assigned a first transparency value and a second set of encoded pixels each of which is assigned a second transparency value, the second transparency level being different from the first transparency level. The encoded pixels may be distributed among a set of blank pixels such that each encoded pixel neighbors one or more blank pixels in the watermark image, and in particular at least two blank pixels in the watermark image. Herein, each blank pixel may be assigned the second transparency value. The watermark image may be overlaid and blended over a background source image to create an encoded source image. A decoder system may recover encoded information from the encoded source image.

Abstract: A computer-implemented method for protecting user identity within online content providing environments uses a security content management system (CMS) including at least one processor and a memory. The method includes identifying a request for an online content item associated with an online device. The online device is associated with actual device data. The method also includes determining a first characteristic value associated with the actual device data of the online device. The method further includes generating, by the processor, substitute device data. The substitute device data represents at least the first characteristic value. The method also includes providing the substitute device data to an online content provider.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enforcing publisher content item block requests. In one aspect, a method includes receiving a set of declared network locations for a content item and rendering the content item. A request is initiated for a resource that is referenced by the content item, and network locations fetched in response to the request are logged. A composite set of network locations that includes the fetched network locations and declared network locations is generated. The composite set of network locations is used to enforce publisher block requests.

Abstract: A watermark image may be generated that includes a first set of encoded pixels each of which is assigned a first transparency value and a second set of encoded pixels each of which is assigned a second transparency value, the second transparency level being different from the first transparency level. The encoded pixels may be distributed among a set of blank pixels such that each encoded pixel neighbors one or more blank pixels in the watermark image, and in particular at least two blank pixels in the watermark image. Herein, each blank pixel may be assigned the second transparency value. The watermark image may be overlaid and blended over a background source image to create an encoded source image. A decoder system may recover encoded information from the encoded source image.

Abstract: An example process includes: obtaining information about call-outs from at least one bidder of an online content auction, where the information spans a time period and the information identifies which call-outs, within the time period, did not result in a response; identifying, based on the information, one or more features that are common to call-outs that did not result in at least a threshold number of responses from the at least one bidder; generating a model for the at least one bidder that predicts whether the at least one bidder will respond to a call-out associated with the one or more features; using the model to determine a percentage of additional call-outs having the one or more features to send to the at least one bidder; and sending the percentage of additional call-outs to the at least one bidder.

Abstract: A method performed by one or more processing devices includes receiving a request for a content item for placement with a resource provided by a publisher. The method also includes, in response to receiving the request for a content item, sending a request to the publisher for one or more constraints associated with content items for placement with the resource of the publisher. The method also includes receiving data from the publisher that provides the one or more constraints. The method also includes identifying a particular content item from a content item provider for placement with the resource based at least on applying the provided one or more constraints, and, providing the particular content item for presentation with the resource provided by the publisher.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enforcing publisher content item block requests. In one aspect, a method includes receiving a set of declared network locations for a content item and rendering the content item. A request is initiated for a resource that is referenced by the content item, and network locations fetched in response to the request are logged. A composite set of network locations that includes the fetched network locations and declared network locations is generated. The composite set of network locations is used to enforce publisher block requests.

Abstract: A method includes receiving, from one or more publishers having an associated inventory of one or more content item slots, (i) a first identifier specified by the one or more publishers and associated with the one or more publishers and (ii) a second identifier specified by the one or more publishers and associated with the inventory of content item slots, wherein the first identifier is associated with a branding tier. The method includes receiving a request for a content item associated with the inventory of content item slots; and in response to the request, performing a content auction, including providing the first identifier, the second identifier, or both, based on the branding tier.

Abstract: An example process includes: obtaining information about call-outs from at least one bidder of an online content auction, where the information spans a time period and the information identifies which call-outs, within the time period, did not result in a response; identifying, based on the information, one or more features that are common to call-outs that did not result in at least a threshold number of responses from the at least one bidder; generating a model for the at least one bidder that predicts whether the at least one bidder will respond to a call-out associated with the one or more features; using the model to determine a percentage of additional call-outs having the one or more features to send to the at least one bidder; and sending the percentage of additional call-outs to the at least one bidder.

Abstract: Methods, systems, and apparatuses for improving performance of parallel database query plans are described. An exchange operator is positioned in a query tree. A child operator of the exchange operator is parallelized into a plurality of parallel child operators, each of the parallel child operators coupled to the exchange operator in a respective branch of a plurality of parallel branches of the query tree. An output of each of the plurality of parallel child operators may be buffered at the exchange operator. Furthermore, child operators of the plurality of parallel child operators may also be parallelized. Query plans of any form and containing any number of operators may be parallelized in this manner. Any number of parallel branches may be used, independent of the number of operators in the original plan. The parallelized query plans achieve effective load balancing across all branches.

Abstract: Methods, systems, and apparatuses for improving performance of parallel database query plans are described. An exchange operator is positioned in a query tree. A child operator of the exchange operator is parallelized into a plurality of parallel child operators, each of the parallel child operators coupled to the exchange operator in a respective branch of a plurality of parallel branches of the query tree. An output of each of the plurality of parallel child operators may be buffered at the exchange operator. Furthermore, child operators of the plurality of parallel child operators may also be parallelized. Query plans of any form and containing any number of operators may be parallelized in this manner. Any number of parallel branches may be used, independent of the number of operators in the original plan. The parallelized query plans achieve effective load balancing across all branches.

Abstract: A database system and methodology for generalized order optimization is described.

Abstract: A database system and methodology for generalized order optimization is described.

Abstract: In a database system, a method for optimization of a query is described. When a query is received which requests data from a database, a plurality of plans which can be used for obtaining data requested by the query are enumerated. A search tree is created based upon these plans, with nodes of the search tree representing segments of the plans. A limited number of nodes of the search tree are selected for evaluation to limit the effort spent on query optimization. A complete plan for execution of the query is generated by evaluating the selected nodes of the search tree and, if the evaluation determines that a given node is more favorable than comparable nodes previously evaluated, retaining the given node as part of the complete plan.

Abstract: In a database system, a method for optimization of a query is described. When a query is received which requests data from a database, a plurality of plans which can be used for obtaining data requested by the query are enumerated. A search tree is created based upon these plans, with nodes of the search tree representing segments of the plans. A limited number of nodes of the search tree are selected for evaluation to limit the effort spent on query optimization. A complete plan for execution of the query is generated by evaluating the selected nodes of the search tree and, if the evaluation determines that a given node is more favorable than comparable nodes previously evaluated, retaining the given node as part of the complete plan.