Yahoo! Inc.

Sun Microsystems, Inc.

Quotient Technology Inc.

Coupons.com Incorporated

Oracle America, Inc.

Yahoo Ad Tech LLC

Sajjit Thampy

Amr Awadallah

Kenny C Gross

Daniel Ferrante

Kavel Patel

Deepak Goel

Kalyanaraman Vaidyanathan

Aleksey M Urmanov

Keith A Whisnant

Kenneth Clayton Gross

David A Gerster

Disclosed herein is a statistical approach, a win share approach, used to assign a win share value to content items. User interaction with content items is tracked, and a win share value is assigned to content items in response to a 'winning' action performed by a user. Win shares associated with content items are used to identify content items that are to be presented, and can further be used to identify an optimal presentation, e.g., layout, presentation frequency, etc., of content items that is to be presented.

Computerized system and method for analyzing user interactions with digital content and providing an optimized content presentation of such digital content

Techniques are provided for determining, by a coupon distributor, a value for a coupon of a product or service that will be provided by a coupon provider. The coupon provider provides, to the coupon distributor, one or both of a budget value that indicates an amount the coupon provider is willing to pay the coupon distributor for distributing the coupon, and a redemption rate that indicates one or more target redemption rates. The coupon provider uses a coupon value equation to calculate the coupon value based on a budget value and a redemption rate. The coupon provider might estimate that no coupon value will allow the coupon provider to stay within the budget and ensure that the actual redemption rate will be close to a particular redemption rate, which may or may not be specified by the coupon distributor.

Determining a value for a coupon

Content optimization system and method

Techniques are provided for generating, by a coupon distributor, a score that represents a quality of a coupon campaign that a coupon provider offers to the coupon distributor. The score may be generated based on the brand of the product, the product category to which the product belongs, the coupon value, and the percentage discount reflected by the coupon. One or more of these factors may be based on historical data that indicates the success (or failure) of previous coupon campaigns (e.g., of the same product, brand, and/or product category, and/or similar coupon value). The coupon distributor uses the score to, e.g., determine whether to accept a proposed coupon campaign, project the number of prints/redemptions of the coupon campaign, determine how to present the coupon, determine an amount to charge for running the coupon campaign, and/or determine products or product categories of coupons to which the coupon distributor should seek.

Generating a score for a coupon campaign

Apparatuses, methods, and systems directed to detect Internet bots in communication networks. Some embodiments of the present invention allow an agent of a server to periodically record interaction events on a client system. The recorded interaction events are sent to a server and validated by a statistical test. Some embodiments of the present invention may be used to detect bots using server logs. In other embodiments, an agent of a server is able to detect and validate interaction events on a client system and the server periodically polls the agent to determine whether bots are detected on the client system.

System and method for detecting internet bots

Apparatuses, methods, and systems directed to detect Internet bots in communication networks. Some embodiments of the invention allow an agent of a server to detect human interaction events on a client system. In other particular embodiments, the systems and methods disclosed below can be used to detect bots using server logs. In some other embodiments, the present invention involves sending an agent to a client system and polling the agent on whether human interaction events are detected on the client system.

System and method for detecting Internet bots

A method of determining one or more association rules includes: specifying site-sequence values for users, wherein each user is identified with one of a plurality of engagement levels, and the site-sequence values indicate a sequence from a first site to a second site for at least one user identified with a corresponding engagement level; determining cumulative site-sequence values from the site-sequence values for combinations of pairs of sites and distinct engagement levels; determining likelihood values from the cumulative site-sequence values, wherein the likelihood values characterize probabilities for sequences between sites at distinct engagement levels; determining one or more association rules for pairs of sites from one or more corresponding likelihood values at one or more engagement levels, wherein each association rule indicates a sequential association between a corresponding pair of sites; determining one or more confidence values for the one or more association rules by calculating one or more variations of the likelihood values across the engagement levels; and saving one or more values for the one or more associations rules (e.g., likelihood values or confidence values).

Forecasting association rules across user engagement levels

The subject matter disclosed herein relates to simulation of bucket testing. In a particular implementation, cohort of users associated with a value for an engagement metric may be selected based at least in part on an intersection of first and second probability distributions. Behavior of the first and second groups may be compared based at least in part on the selected cohort of users.

Simulated bucket testing

A system that identifies processes with a memory leak in a computer system. During operation, the system periodically samples memory usage for processes running on the computer system. The system then ranks the processes by memory usage and selects a specified number of processes with highest memory usage based on the ranking. For each selected process, the system computes a first-order difference of memory usage by taking a difference between the memory usage at a current sampling time and the memory usage at an immediately preceding sampling time. The system then generates a memory-leak index based on the first-order difference and a preceding memory-leak index computed at the immediately preceding sampling time.

Method and apparatus for detecting memory leaks in computer systems

One embodiment of the present invention provides a system that resamples a quantized signal. During operation, the system receives the quantized signal. Next, the system smoothes and resamples the quantized signal to produce a resampled signal. The system then quantizes the resampled signal to produce a quantized resampled signal. For a given time point, the system determines a probability distribution for the resampled signal across quantization levels at the given time point by using information about the values of the resampled signal at neighboring time points. Note that the probability distribution specifies the probability that the resampled signal would be sampled at specific quantization levels. The system then uses the probability distribution to probabilistically select a quantization level for the resampled signal for the given time point.

Barycentric coordinate technique for resampling quantized signals

A system that detects a change point in a time series of telemetry signals from a computer system. During operation, the system receives the time series of telemetry signals from the computer system. For each element in the time series, the system (1) inserts the element into a data structure which keeps track of the number of elements in the data structure that have a value greater than and that have a value less than the value of the inserted element; and (2) uses the information stored in the data structure to add a contribution by the inserted element to a trend statistic for the time series. The system then uses the trend statistic to select a hypothesis for the trend in the time series.

Method and apparatus for detecting a change-point in a time-series of computer telemetry signals

One embodiment of the present invention provides a system that monitors system-calls to identify runaway processes within a computer system. First, the system monitors system-calls on the computer system during runtime, to generate a trace of system-calls made. Then, the system analyzes the trace to detect runaway processes.

Monitoring system-calls to identify runaway processes within a computer system

One embodiment of the present invention provides a system that optimizes support vector machine (SVM) kernel parameters. During operation, the system assigns sets of kernel parameter values to each node in a multiprocessor system. Next, the system performs a cross-validation operation at each node in the multiprocessor system based on a data set. This cross-validation operation computes an error cost value reflecting the number of misclassifications that arise while classifying the data set using the assigned set of kernel parameter values. The system then communicates the computed error cost values between nodes in the multiprocessor system, and eliminates nodes with relatively high error cost values. Next, the system performs a cross-over operation in which kernel parameter values are exchanged between remaining nodes to produce new sets of kernel parameter values. This process is repeated until a global winning set of kernel parameter values emerges.

Growing community of inventors

Sunnyvale, CA, United States of America

Sajjit Thampy